A. State the size of the input in big-Oh. For example, if the input to an algorithm is an array of size k, then the input size is n O(k).

B. Derive the cost function for the algorithm.

C. State the complexity of the algorithm in Big-Oh. The complexity MUST be stated in terms of input-size.

D. Prove that the derived cost function is in the stated order (big-Oh).

input: P[k] // Array of (x,y) coordinates output: d / Maximum distance over all pairs of coordinates d=0 for i = 0 k-1 for j = 1 + 1 k dy = P [i d = max(d, sqrt (dx*dx + dy*dy)) returnd