Question $5$:$15$ points

Professor Bond has developed the following algorithm that he claims is going to be a break

through in computer science.

Assuming array is zero indexed, $A[0]$ is the first and $A[n-1]$ is the last element, the algorithm

is as follows:

Given all of this, answer the following questions.

$($a$)[5$ points$]$ Explain what the algorithm does in plain English.

$($b$)[10$ points$]$ What are the best and worst cases, that is$,$ what sort of input leads to best$/-$

worst cases, for the algorithm? What is the $(cdots)$ bound on the running time of the best

and worst case of this algorithm? Explain and show your work.