Consider the following memory representation of linked list: START=4, AVAIL=3. i) Find the sequence of characters in the list. ii) Suppose F \& then C are deleted from the list and G is inserted at the beginning of the list. Find the final structure. iii) Suppose C& then F are deleted from the list and G is inserted at the beginning of the list. Find the final structure. iv) Suppose G is inserted at the beginning of the list and then F&C are deleted from the list. Find the final structure