Give code and the drawing to make clear what you are doing.

Here is a diagram of a three node linked list with a head pointer and a node to be inserted. Show all steps necessary to insert the node pointed to by temp between the second and third nodes, including the search for the node prior to insertion. You are to make clear the sequence of steps by either numbering the steps, or by makingseveral copies of this drawing, with one change per drawing, numbered to show the sequence. You may assume a search routine taking a head node and data has been defined for you.

Although the instructions say to assume the search has been done, I
include it, as it really is necessary.