Urgent!!:

Data Structures and Algorithm related Question:

04: (5 + 2.5 Marks) Answer the following questions: i. Consider A, B, C, D, E and F are six different Universities in Islamabad. Here we are assuming that you are availing the Careem facility in order to cover the distance between different universities. Being a student of university B, find the shortest routes to other universities using Dijkstras algorithm. A B F 3 E D