The world cup cricket match is to be held in a particular city. Fans from all other cities travel to this city to watch the match. Assume that we are given a weighted, directed graph G(V,E) that represents the connectivity and distances betweenall cities. Develop an algorithm that computes the shortest paths from all cities to this city. Give an algorithm for the problem.