Given an array of integers A$[0..$n$-1],$ write a recursive algorithm that counts the number of elements for which $A[i]=i,$ where $i$ is an index of the array $A.$ Your algorithm divides the array into two equal halves and counts the number of element for which $A[i]=i$ in each half recursively.