1. a. Prove that the time efficiency of Warshall's algorithm is cubic.
b. Explain why the time efficiency class of Warshall's algorithm is inferior to that of the traversal-based algorithm for sparse graphs represented by their adjacency lists.
2. Explain how to implement Warshall's algorithm without using extra memory for storing elements of the algorithm's intermediate matrices.