I need it fast

Question 2 (40 point):_ Give the output of the Rollowing program and draw the link list struct node { int info; struct node link: }; typedef struct node nodePTR; void insort (nodePTR struct Info); nodePTR getnode(): int main(void) { nodePTR p=NULL, head=NULL,save; int i; for(i=0; iinfo); save=save->link; } while(save!=NULL); return 0; output } 567 nodePTR getnode() { nodePTR q; q=(nodePTR) malloc (sizeof(struct node)); return q; Draw the Link List ontinue next page=> a void insort(NODEPTR "head. int x) NODEPTRP.4.1: 4-NULL; for(p ="head; pl-NULL &&x>pinfo, plink) qp: if (NULL)/" insert to the front of the list f (p-getnode(): p> info x; plink - head; head-p: 3 else /* inserting between p and q*! {r=getnode; q link=1 info=x; link = p; }