Given the Modified sequential search code, in which values are stored in increasing order in the array. Assuming the length of the array is n and all possibilities for success are equally likely derive an exact formula as a function of n (NOT BIG O) for the AVERAGE number of comparisons for successful searches. Ignore the initial < comparison in the for loop.

Then please do the average case for failure please if you can thanks!

public boolean search(int[] A, int target){

for( int i=0 ; i < A.length ; i++) {

if (target == A[i] ) return true;

if( target < A[i]) return false:

}

return false;

]