Part (a) Write an algorithm for sorting with consideration that n data is stored in linked list. Don't make any assumption just stick to the following instructions: Each node contains an INFO field...

Extracted text: Part (a) Write an algorithm for sorting with consideration that n data is stored in linked list. Don't make any assumption just stick to the following instructions: Each node contains an INFO field and a NEXT pointer. Start contains the address of the header node. Don't change any values in the INFO. Part (b) – Consider the given algorithm for insertion of a data at after the given location in linked list. INSLOC(INFO, LINK, START, AVAIL, LOC, ITEM) 1. [OVERFLOW?] If AVAIL = NULL, then Write: OVERFLOW, and Exit // [Remove first node from AVAIL list] 2. Set NEW := AVAIL and 3. AVAIL := LINK[AVAIL] 4. Set INFO[NEW] := ITEM. [Copies new data into node] 5. If LOC = NULL, then: [Insert as first node] Set LINK[NEW]:= START and START : = NEW 6. 7. 8. else: [Insert after node with location LOC] 9. Set LINK[NEW]:= LINK[LOC] and 10. LINK[LOC] := NEW [End of If structure] 11. Exit Answer the following questions: (i) Draw the diagram for the simulation of the above algorithm such that your diagram reflects the updated link with different colors. Also, show the correspondence in the diagram between updated links and line number of algorithms (ii) Calculate the running time of given algorithm.