Given the adjacency list (a linked list of linked lists) of an undirected weighted graph write an algorithm (code oriented pseudocode) that creates and returns a BST of the this graph's edges. Example: Let's consider an undirected graph with 6 nodes: A, B, C, D, E, and F, and 9 edges: AB = 10, AC = 90, AF = 8, BC = 9, BD = 7, BF = 10, CD = 8, DF = 7, EF = 10 A calling statement is given below: edgeBST graph.createEdgeBST(); Assume that the adjacency list representation of the graph is based on two node structures. Briefly explain what are the elements that you would provide in these two node structures or just write struct definitions with comments. List any assumptions used in your design. Call BST functions as needed (do not provide definitions for BST functions). Upload Choose a File