Please help with question 4

4) (40) Answer the questions for the following algorithm. ("Weight matrix" is a weighted adjacency matrix with Os on the diagonal) ALGORITHM Floyd WLLD Implements Floyd's algorithm for the all-pairs shortest-paths problem Input: The weight matrix Wof a graph with no negativo-length cyck Output. The distance matrix of the shortest paths' lengths D--Wis not necessary if W can be overwritten forktondo fori-Itodo for todo 11, ) min/D[i] D[6.4/+D|X. :D return a) (12) What is the input size? b) (12) Are there different best/worst/average cases of different orders of growth? c) (16) Construct a sum describing the number of basic op calls, but do not solve