When applying the shortest path algorithm for this graph starting from vertex A; after finishing the second iteration what will be the content of smallestWeight matrix? Note: the initial state of the matrix smallestWeight is not counted as an iteration. A 14 19 14 B 3 D 12 15 E 5 F The values are inserted in the matrix in the following order (A, B, C, D, E, F] [O, 4, 9, 12, 16, 24] [O, 4, 9, 12, 13, 18] [O, 4, 9, 14, 16, 0] [O, 4, 9, 12, 13, 24]