// Main class public class GFG // Main driver method public static void main(String args[]) // Creating object of the Il class linked list LinkedList Il = new LinkedList(); // Adding elements to the linked list Il.add("A"); Il.add("B"); II.addLast("C"); II.addFirst("D"); Il.add(2. "E"); System.out.println(II): II.remove("B"); Il remove(3); Il removeFirst: Il removeLast(); System.out.println(II): 3. Now your DB has two values, sorted by weight value in ascending order. Then the key loop begins. Please refer to slides MST.pdf: page 23, 24, and 25 for the details of the algorithm you need to implement. I rewrite them in the following: As long as there is a node which has NOT put in MST: * = OUR_EXTRACT_MIN(); put x to MST: OUR_PUT_EDGES_TO_DB(x): Regarding how to implement "As long as there is a node which has NOT put in MST", there is a way discussed in our "Week10" lecture videos