When implementing the data structure of queue with a linked list, which of the following design is better, (a) or (b), when efficiency is considered? (a) insert at the front of the linked list and remove from the end of the linked list; (b) insert at the end of the linked list and remove from the front of the linked list; Please justify your answer.