QUESTION 16 Assume "p" is a reference that points to a node in a doubly linked list Arrange the following activities so that one can insert a new node named "temp" in front of "p" without losing any node: p.prev = temp temp.next =p p.prev.next-temp temp.prev.prev QUESTION 17 Which of the following implementation is the best in terms of time consumption when we have a music player that allows us to skip to next song, go back to previous song, and automatically play the first song after playing the last one in the list? Singly linked Ist OB Crcular Singly linked list . Circular Doubly linked list OD All of the above have the same performance