4. Assuming Floyd's algorithm uses node 1 for its first pivot and node 2 as its second pivot, give the adjacency matrix after the first two iterations, i.e. after using both node 1 as a pivot and node 2 as a pivot. 4 4 3 6