this is the assignment of our college which has given to us almost 70 % of part had been just linked representation part is left and some part of dfs and bfs i also want to review my assignment with yours so plz get me the appropriate solution of this attached doc. Document Preview: Individual Assignment (Algorithmics-CE00333-3) Learning Outcomes: To learn how to create the Adjacency Matrix and Adjacency List for a given graph and to find best technique after analysis and any alternatives for the worst among given techniques. To traverse and to find a vertex in the given graph using Depth and Breadth First Traversal methods. To find the shortest path using Dijkstras Single Source Shortest Path algorithm. To solve the given graph to find out the Minimum Spanning Tree (MST). To compare the execution time efficiencies for all the above algorithms with their standard complexities in terms of Big Oh notation. To determine the classes of the above problems with their justifications. Research Assignment (100 marks) Graph theory has many practical applications in the real world. One such application is to determine how a network of interconnected places can be optimized in order to ensure that commuters can travel as efficiently as possible. For this specific assignment, the first graph problem is represented hereby: Fig. 1 Graph Theory Problem (for BFS, DFS & Dijkstras SSSP) The nodes in the above diagram represent the various places scattered across a country, while the edges represent the roads running between them. The weights of each edge represent the distance between each place. You have to deliver a solution for the GRAPH THEORY problem mentioned above by drawing the adjacency list and adjacency matrix. Write a report on which of the approaches is most beneficial and in under which circumstances it is beneficial. You are also required to solve step-wise and compare the efficiencies of the given problem with BFS, DFS and Dijkstras Single Source Shortest Path (SSSP) algorithms in terms of Big-Oh notation with their calculated execution times (For BFS and DFS algorithm assume the graph as undirected and unweighted). Include algorithm/pseudo-code with your explanations and describe that how efficiency can be increased in case Attachments: Algorithmics-.docx