Code in C++ Related to data structures

Code in C++ Related to data structures

B. Write a function called DelAllMinEdge(). This function will first search all the edges in the graph and will delete the edge with the minimum weight. Consider that graph is implemented using Adjacency List. Consider the following structure for both Vertices and Edges Struct GNode { int data, weight; GNode *ptr; 1 *GList; Note: In the following example DelAllMinEdge() will delete the edge between vertex 4 to 3 and 1 to 4 becaus of minimum weight. Data Weight *ptr 2 Data 1 Weight *ptr -1 4 5 2 10 3 N -1 15 3 4 20 5 3 -1 5 18 4 -1 3 5 5 -1 4 25 A. Using big-O notation to solve the asymptotic behavior of the following functions Ta(n) = n2 + 100nlogn + 10 + 1000 ii. Td(n) = 49+1+16n16 B. Solve the worst case time complexity of the following procedure as a function of n by using "Big-oh" notation. Show all the steps of calculation. int i = n; while () for (int j = 0; ji: j--) // Loop 2 for (int k = n; k > 1 k.-) // loop 3 System.out.println("*")<>