1. Create a program that uses a LINKED LIST to do the following:   a. Using the attached file, input.txt, read the integers and dynamically process alinked list. The file contains action code and integer pairs. Process these actions as they are read. The action code is first: I = Insert a new node with the corresponding value. Insert in ascending(sorted) order D = Delete the node with the corresponding value S = Search the current list for the corresponding value   b. You may use any examples reviewed in class that explain how to process a linked list. The book contains examples and code to insert into, delete from and search a linked list   c. If the action is 'S' and the value does NOT exist in the linked list, display an appropriate message. If the value DOES exist in the linked list, display an appropriate message.   d. If the action is 'D' and the value does NOT exist in the linked list, display an appropriate message   e. After all input is processed, display the contents of the resulting linked list   f. Read until end of file. DO NOT code the loop for the number of values in the table   g. Do not use the linked list ADT in the book (although you may use the code in the ADT methods as examples. Design and implement the solution however you wish(all in main, functions, etc.)   The program may be named any name of our choice, must have a .cpp extention; variables may be any nameof your choice.   please show the output of the program too Thank you

Write a function, to be included in an unsorted linked list class, called getLargest, that will return the largest item in the list.

This program will use an array implementation of a linked list to keep an ascending sorted list of numbers. The input data consists of two fields: a single character and an integer value. The single character gets interpreted as one of the following: A - represents a value that is to be added to the linked listD - represents a value to be deleted from the linked listP - indicates that all values are to be printed in ascending order The character is only used to determine which process is to be executed; it should not be printed, entered into the linked list, or processed in any way. The main program should be mainly function calls. Process input data until end of file. All output should be sent to an output file and be appropriately formatted and labeled. Keep a running log of everything that is going on in the processing. Input file: A 54A -17A 32 A 81 A -30 A 18 P A 41 A 93 A 65 A 80 A 104 A -20 D 81 D 54 D -30 A 79 A 63 A 77 A –33 D 104 D -20 D 80 D 32 P

Create class Test in a file named Test.java. This class contains a main program that performs the following actions: Instantiate a doubly linked list. Insert strings “a”, “b”, and “c” at the head of the list using three Insert() operations. The state of the list is now [“c”, “b”, “a”]. Set the current element to the second-to-last element with a call to Tail() followed by a call to Previous()Then insert string “d”. The state of the list is now [“c”, “d”, “b”, “a”]. Set the current element to past-the-end with a call to Tail() followed by a call to Next(). Then insert string “e”. The state of the list is now [“c”, “d”, “b”, “a”, “e”] . Print the list with a call to Print() and verify that the state of the list is correct.