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: E[k] [k] // 2D array adjacecy matrix of a graph output: D[k] [k] // 2D array of distances between any two vertices in a graph D-array [k] [k] for i-0 k for j - 0 k else if E[i] [j]1 else D [i] [j] MAX-INT = for h=0 k for i 0 k for j =0 k if D[i] [j] > D[i] hD[h] [j] D[i] j]-Di] [h] D[h] [j] return D