In line 35 code the enqueue Function according to this pseudocode

Ainclude estdifb.hs Anclude cstdito.hs Altelude "queve. h V/write this function Mode "tofree - q-2head; Int tolieturn = q-Shead->data; If (q head =q tail ){ //only one node in queue q-shead = MuLl; q3tan1= IILL 5 belse\{ f q->head - q->head-rnext; free(toFree); return toReturn; \} Int peek(Queue q) ) if(istepty(q)) fprint f( stderr, "tried peeking an enpty queuel h); 3 return q-Shead->data; 3 Int isfapty(Queve * q ) return q> head -- null; //for you TODO //malloc a toInsert Node struct // initialize toInsert data= data //and toInsert next = NULL //toInsert priority = priority //if isempty //set head and tail to point //at toInsert //else //set tail set tail = toInsert = toInsert