Which of the following data structures is best suited for implementing a Last-In-First-Out (LIFO) behavior? A) Queue B) Stack C) Linked list D) Tree

Write a C code for the structure types of a dynamic linked list implementation of a “queue”. Each node of the queue will have the following information: Name of the queue: library_tComponents of the queue:Book_Name (name of the book)Writter_Name (name of the writter)ID (identification number of the book)Edition (edition of the book)Link: pointer/link to next node Write functions to add and remove the nodes of the queue and use printf() to show that the code is working properly

54. What is the difference between the top and pop operations of a stack? Group of answer choices The top operation removes the top item of the stack. The pop operation returns a reference to the top item on the stack and remove it.   The top operation removes the top item of the stack. The pop operation returns a reference to the top item on the stack without removing it.   The pop operation removes the top item of the stack. The top operation returns a reference to the top item on the stack without removing it.   The pop and top operations are doing the same thing which removes the top item of the stack.   The pop operation removes the top item of the stack. The top operation returns a reference to the top item on the stack and remove it.

i want the solution for subpart 1