Q)a)(T/F) In the Floyd-Warshall algorithm, we obtain an O(V³) algorithm for the all-pairs shortest paths problem by considering the subproblem What is the shortest path from v_i to v_j that uses at most k edges?.

b)] (T/F) The TRANSITIVE-CLOSURE procedure using the Floyd-Warshall algorithm runs in (n³) time. However, this algorithm cannot be used if the graph has a cycle.