Giver the graph below, answer the questions below by applying Dijkstra's shortest path algorithm 10 8 A 1 4 7 9 3 If the start vertex is A the length array would be initialized with the following values (enter i for infinitys: After completing one entire iteration of Dijkstra's algorithm 1. the node would be added to the visited set and 2. the touch and length arrays would have the following values (enter i for infinity): A/B touch A length After completing two entire iterations of Dijkstra's algorithm. 1. the node would be added to the visited set and 2. the touch and length arrays would have the following values (enter i for infinity): AB touch A length o After completing three entire iterations of Dijkstra s algorithm. 1. the node would be added to the visited set and 2. the touch and length arrays would have the following values (enter i for infinity: JAB D touch A length o If the start vertex is a, in the fourth teration of Dijkstra's weighted shortest path algorithm, verte is added to the known set with a cost of