12. How do you remove a node from a doubly-linked list? Assume that previous refers to the node in the list before the node we wish to remove, and that each node has a next and previous field. A. previous.next.next.previous = previous; previous.next = previous.next.next; (ANSWER) B. previous.next = previous.next.next; previous.next.next.previous = previous; C. previous.next.previous = previous; previous.next = previous.next.next.next; D. previous.next = previous.next.next.next; previous.next.previous = previous; E. None of the above 13. Which of the following is NOT an example of an algorithm? A. A recipe for baking chocolate chip cookies. B. The list of instructions to follow in order to install Eclipse on your computer. C. A program that calculates and returns a list of every prime number. (ANSWER) D. A program that takes in an integer as input and simply outputs the same number. E. None of the above