Given an array of single digit numbers, return all the index's of the first smallest prime number. Continue the search from the index found. The prime number is made by combining the numbers. Must be recursive. So for [1, 0, 7, 6, 7, 2, 9, 2], the indexes returned will be 3, 5, 6. The remaining numbers 9 and 2 will not be considered.

Given an array of single digit numbers, return all the index's of the first smallest prime number. Continue the search from the index found. The prime number is made by combining the numbers. However, if there are numbers remaining, then go back a choose new indexes to make sure the array can be split into all prime numbers. So for [1, 0, 7, 6, 7, 2, 9, 2], the indexes returned will be 3, 5, 7.