no elements among the first in (this kind of trivially true claim is said to hold vacuouslyin iteration iwe compare element to element [iand return the index if these two elements are equalwhich is clearly correct and completes the algorithm in this case if the two elements and [iare not equalthen we have found one more element not equal to and we increment the index thusthe claim will be true for this new value of ihenceit is true at the beginning of the next iteration if the while-loop terminates without ever returning an index in athen we have that iss is true--there are no elements of equal to thereforethe algorithm correctly returns -- to indicate that is not in exercises for source code and help with exercisesplease visit java datastructures net reinforcement - give pseudo-code description of the ( )-time algorithm for computing the power function (xnalsodraw the recursion trace of this algorithm for the computation of ( , - give java description of algorithm power for computing the power function (xn(code fragment - draw the recursion trace of the power algorithm (code fragment which computes the power function ( , )for computing ( , - analyze the running time of algorithm binarysum (code fragment for arbitrary values of the input parameter - graph the functions nlogn and using logarithmic scale for the xand -axes that isif the function value (nis yplot this as point with xcoordinate at log and -coordinate at log -