10. The following algorithm checks the contents of an array in the positions that are powers of 2 (i.e. indices 1, 2, 4, 8, 16, etc). The algorithm returns true as soon as it finds an array position where the index and the value stored in that index are the same. If no position satisfies this condition, the Boolean value false is returned. 1 2 3 4 5 6 7 8 9 10 11 12 13 A: array N: number of elements of array A, equal to a power of 2+1 (e.g. 2, 3, 5, 9, 17, etc). function F(A,N) i=1 while(i