I. Given the following matrix for parathion location generated by the Dynamic programming solution for the Matrix multiplication A 1 XA 2 X A3 X A4 X A5. Show the order of the multiplication operations. A2 АЗ A4 A5
A1 1 2 2 2
A2 2 2 4
АЗ 3 4
A4 4
ii. Given the following matrix P generated by the Floyd algorithm for a graph with 7 nodes V1, V2,V3, V4,15,16,17 . Determine the shortest route for the following:
From node V1 to node V5.
0 0 5 2 4 0 6
0 0 5 6 4 0 4
2 0 0 2 4 2 4
2 0 5 0 0 2 0
4 4 0 0 0 4 4
7 7 7 7 7 0 0
4 4 5 0 4 4 0