You are going to show the progression of the state of a link…
You are going to show the progression of the state of a linked list as we run several methods sequentially on it (starting with the initial state below). You will represent the linked list as follows: size = 2; head => “A” => “B” => null This example represents a linked list with the strings “A” and “B”. An empty list is “size = 0; head => null”. Only include quotation marks for any Strings. Write the state of the linked list after each method call If the method call is invalid, explain why below the representation of the linked list (the linked list remains unchanged from the previous state) If a method returns a value, put “Returned: ” next to the representation of the linked list. The methods follow the same conventions as the Linked List homework Initial state: size = 2; head => “KSU” => “UNG” => null 1) add(“GSU”) 2) remove(1) 3) indexOf(“GSU”) 4) clear() 5) add(1, “GCSU”) 6) add(“GT”) 7) remove(“UGA”) Use this template for your answer (please type fully – you cannot copy): 1: . 2: 3: 4: 5: 6: 7: