The answer is A, but I'm not sure why. If possible, please show work and explanation. Thank you!

~Given the following 1 hop matrix (X), where Os represent infinities and using Floyd's algorithm, determine the minimum cost 2 hop path from Node A to node E. A B C D E F G H A| 0 0 3 3 0 0 4 3 | B| 3 3 3 01010 | C| 0 0 0 0 0 2 0 0 | D| 0 0 0 0 2 1 3 0 | El 2 0 1 3 4 0 01 | F 0 20 44 1 20 | G| 0 0 3 0 3 0 0 2 | H] 0 4 0 0 0 24 0 | a. b. c. d. 5 3 6 4 7 e