Let be a path. The cost of is the sum of weights along the path. The hops-count h (r) or is the number of edges in . Note that for every simple path , h(r) n-1. Describe an algorithm that in time (mn log n) computes for every u E V an array A1...n), where (for every 1 SiSn-1) the cell 1li, contains the length of the shortest path s u with hop-count i That is, the output consists of n -1 numbers .The length of the cheapest path with hops-count1 . The length of the cheapest path with hops-count 2 .The length of the cheapest path with hops-count n-1 So this is one of the instances of the bi-critiria shortest path which could be solved in Let be a path. The cost of is the sum of weights along the path. The hops-count h (r) or is the number of edges in . Note that for every simple path , h(r) n-1. Describe an algorithm that in time (mn log n) computes for every u E V an array A1...n), where (for every 1 SiSn-1) the cell 1li, contains the length of the shortest path s u with hop-count i That is, the output consists of n -1 numbers .The length of the cheapest path with hops-count1 . The length of the cheapest path with hops-count 2 .The length of the cheapest path with hops-count n-1 So this is one of the instances of the bi-critiria shortest path which could be solved in