Exercise 3 successive steps of an algorithm DELFRONT L, head) that takes as input a (singly) linked list L and a pointer head to its first entry and outputs the list obtained from L by deleting the first entry of L. Assume that each entry node of L stores an element node.elem and a pointer node.nert to the next entry Assume L is not empty. If ptr is a pointer to an entry, let ptr next be the entry's pointer Describe carefully in English, or with a pseudocode, the