Please solve the following question:

Please show your work in solving it and in clear writing. Thank You.

Multiple Choice For each question, select the best answers that apply. More than one answer can be identified and D is always going to be "None of the above". This means no question will have multiple answers with D selected (such as A and D). The minimum to circle is at least one answer and the most would be A, B and C. Each question is worth 3 points. 1) Which of the following is true when adding nodes in a standard linked list (standard means only a head node pointer exists for the linked list)? a. Inserting a node at the beginning of the list is O(n) while appending a node to the end of the list is 0(1) b. If the list is empty, no insert is performed C. The insert algorithm first checks to see if the linked list is at full capacity d. None of the above 2) Which of the following is true about the search function for a standard linked list? a. Even if the data is sorted, the search algorithm is still worst case O(n) b. During the search, it is important that the head node always stays set to the first element of the list C. If the element is not found after searching the entire list, another check is done by going backwards through this list to make sure the element is not there d. None of the above 3) Which of the following is true about deleting nodes in a standard linked list? a. Delete is 0(1) in the worst case because there is no shift after removing the node b. If the linked list is sorted, the delete algorithm significantly improves to Odlog n) c. In the delete algorithm, the "previous" node reference is needed in the situation where the node to delete may be after the first node in the list d. None of the above