Data Structures and Algorithms:

Computer Science Java.

Please show the steps how the answer is obtained and justify the reasoning.

1.B.

What is the cost function for the following algorithm? input: dist [n] [n], where dist[i] [j] = distance of direct road, if city i has a direct road to city j output: D[n] [n] 2D arrays, where D[i] [j] is the minimum distance between city i and j Page 1 D = array [n] [n] for i = 0 ... n for j = 0 ... n if dist[i] [j] > 0 D[i][j] else dist[i] [j] %3D D[i] [j] infinity for i = 0 D[i][i] in for k = 0... for i %3! for j if D[i] [j] > D[i] [k] + D[k] [j] D[i] [j] = D[i] [k] + D[k] [j] ... return D 18n^4 + 1ln^3 + 6n^2 + 4n + 5 18n^3 + 11n^2 + 6n + 4 18n^2 + 11n + 6 18n + 11 What is the cost function for the following algorithm? input: sorted vals[n] and element e output: true if e is in vals low = 0 high = n - 1 while low