The diagram below suggests how we could implement a double-ended linked list, in which we maintain a reference to both the first and last nodes in the linked list. 35 17 front 6 29 null rear Which one of the following operations would be inefficient to carry out when there are a large number of elements in the linked list? A. B C. D. E. insertion at the end to which front refers insertion at the end to which rear refers deletion from the end to which front refers deletion from the end to which rear refers test for an empty linked list