last digit of student ID in odd

Note: Draw Diagram of every step you do not just one final Diagram.

Question 3: (CLO 2][PLO 3][C6][10 Marks] Draw shortest paths from a starting node to all other nodes in the given Graph by applying Dijkstra Algorithm. Starting Node = A for students with Even last digit in student id Starting Node = 'D' for students with Odd last digit in student id 24 A B 23 6 18 G 5 16 8 H 10 14 E D 21