The code below reverses the order of items in a plain C++ array. Explain the logic briefly. Can the same approach be used with a singly-linked list? What about a doubly-linked list? Justify your answers precisely. (3 marks) for (int i = 0, j = size-1; i < size/2; i++, j--) { = v; } int v = items[i]; items[i] = items [j]; items[j] (b) Write the C++ function below that will reverse any singly-linked list starting at head, reversing all node pointers as illustrated below. (5 marks) before: A B C D after: D C BA void reverse ( Node*& head ); (c) Explain what Node* & is and why we need * and & in the above. (1 mark)