1. You are given a graph, a src vertex and a destination vertex.2. You are give a number named "criteria" and a number "k".3. You are required to find and print the values of 3.1 Smallest path and it's weight separated by an "@"3.2 Largest path and it's weight separated by an "@"3.3 Just Larger path (than criteria in terms of weight) and it's weight separated by an "@"3.4 Just smaller path (than criteria in terms of weight) and it's weight separated by an "@"3.5 Kth largest path and it's weight separated by an "@"