Consider the following map for restaurants and two clients' houses, what is the closest restaurant branch for every client apartment? Task 2.1 Examine how Dijkstra and Bellman Ford algorithms are applied to get the shortest path, show the detailed tracing of both algorithms. Task 2.2 Assess critically and in details, the complexity of both Dijkstra and Bellman Ford Algorithms, explain in details how we got the complexity of every algorithm and based on which implementation details in the algorithm. R: Restaurant ST: street C: Client