Tasks: 1. Please answer the questions below (Make sure to identify your answer by the question number, Draw the list to show the changes applied after executing EACH statement for sub-questions a and c. Use'y" in the box indicates a null pointer. 2 point each): list | 1 4 next prev a. list.next list.next.prev; b. Will you lose access to any node because of the operation in step (a)? Why? c. Based on the result of step (a), what will your list contain after applying the statement below list- list.prev; 2. Assuming time cost is the most important thing in our decision making process, present at least ONE example scenario that can best be solved by using a circular singly linked list (no need for a doubly linked list), explain WHY (3 point) 3. Assuming each reference costs 1 byte, and each piece of data/info costs 1 byte as well. When will a doubly linked list be more appropriate when space cost is the most important thing in our decision making process comparing to a 256 element array? Why? (3 point) Tasks: 1. Please answer the questions below (Make sure to identify your answer by the question number, Draw the list to show the changes applied after executing EACH statement for sub-questions a and c. Use'y" in the box indicates a null pointer. 2 point each): list | 1 4 next prev a. list.next list.next.prev; b. Will you lose access to any node because of the operation in step (a)? Why? c. Based on the result of step (a), what will your list contain after applying the statement below list- list.prev; 2. Assuming time cost is the most important thing in our decision making process, present at least ONE example scenario that can best be solved by using a circular singly linked list (no need for a doubly linked list), explain WHY (3 point) 3. Assuming each reference costs 1 byte, and each piece of data/info costs 1 byte as well. When will a doubly linked list be more appropriate when space cost is the most important thing in our decision making process comparing to a 256 element array? Why? (3 point)
