Assume that the following types and variables have been defined in C and are avail- able for use: typedef char AirportCode[4] typedef struct Node Tag { AirportCode Airport; struct NodeTag *Link; } Node Type; Node Type *L, *M, *N; Write a function, Delete First(&L), which deletes the first node of a linked list L. Given a non-null pointer N to a node of a list L, and a pointer M to a new node to be inserted, write a C function to insert the node that is Ms referent before the node that is Ns referent on list L. (Hint: Adjust pointers to insert M after N and then swap the airport codes in N and M.]