ASAP ANSWER IN ONE HOUR !!

Q.No.2 Topics covered: Abstract Data Types: List, Stack, Queue a. Consider a 'LinkedList': head/vtx tail i. 11 How can we lose nodes while inserting 15 after 4 in this LinkedList. Which nodes can be lost? Write code for it. How can we lose nodes while deleting 15 LinkedList. Which nodes can be lost? Write code for it. b. An online admission management system is receiving email queries, they read and respond the first email in their inbox. Which Abstract Data Type do they implement (stack or queue)? Choose from linked list and a variable-size array to implement it where you will store queryIDs. Justify your choice. Q.No.2 Topics covered: Abstract Data Types: List, Stack, Queue a. Consider a 'LinkedList': head/vtx tail i. 11 How can we lose nodes while inserting 15 after 4 in this LinkedList. Which nodes can be lost? Write code for it. How can we lose nodes while deleting 15 LinkedList. Which nodes can be lost? Write code for it. b. An online admission management system is receiving email queries, they read and respond the first email in their inbox. Which Abstract Data Type do they implement (stack or queue)? Choose from linked list and a variable-size array to implement it where you will store queryIDs. Justify your choice