Solve the following problem with the help of C or C++ programming language.

Difficulty: Medium In this problem, you will be given a directed weighted graph containing no negative cycles. You will be given a source node S from which you will calculate the distance to another destination node V which will also be given. In this problem the edge weight denotes the to be covered distance between two nodes by traversing through that edge. Here, you also need to find the path that will help you to reach the destination. As there can be multiple paths, to reach a destination, your solution needs to be able to find all the shortest paths or routes. For this problem, you can safely assume that, there will not be be more than 10 shortest paths between any two nodes. This problem can be solved using modified dijkstra. In the algorithm of dijkstra we use D[v] to denote a node's distance from the source. Here you can use two dimensional array to solve this problem (D[v][p]) where the array will hold the shortest distance of v from the source in path number p. In the similar fashion using 2D array you can also save multiple paths' parent nodes information. Input Format: In the first line you will be given an integer N denoting the number of nodes and another integer E denoting the number of edges. In the following E lines you will be given information about the edges. Each such line will contain two integers u and v which indicates that there is an edge from node u to v. After the graph's information you will be given two nodes U and V denoting the source and destination vertex respectively. Output Format: In the first line, you need to print the minimum distance between U and V. In the following line, you will print the number of shortest paths or routes found between U and V that give the same minimum distance. Let the number be e. In the e following lines you will print the intermediate nodes to reach the V from S excluding V and S