bookNo = bNo;strepy (temp->bookName, bName);temp->next = NULL;return temp;};struct Queue* createQueue () {struct Queue* q = (struct Queue*) malloc (sizeof (struct Queue));g->front = q->rear =...

front->bookNo, q->front->bookName); printf ("Last Queue of the book : %d Book Title : $s\n", q->rear->bookNo, q->rear->bookName); return 0; b) Write a function named dequeue () that removed the element in the queue. "/>
Extracted text: struct Book { int bookNo; char bookName [100]; struct Book* next; }; struct Queue { struct Book front, *rear; }; struct Book* newNode (int bNo, char bName [10]) { struct Book* temp = (struct Book*) malloc (sizeof (struct Book) ); temp->bookNo = bNo; strepy (temp->bookName, bName); temp->next = NULL; return temp; }; struct Queue* createQueue () { struct Queue* q = (struct Queue*) malloc (sizeof (struct Queue)); g->front = q->rear = NULL; return g; }; int main () { struct Queue* q = createQueue (); enQueue (q, 01, "The History of Geumga Plaza"); enQueue (q, 02, "Unbeatable of Vincenzo Casano"); deQueue (a) ; enQueue (q, 03, "The Rackless Babel Company"); deQueue (q) ; enQueue (q, 04, "It It's Okay to Not Be Okay"); printf ("First Queue of the book : %d Book Title : $s\n", q->front->bookNo, q->front->bookName); printf ("Last Queue of the book : %d Book Title : $s\n", q->rear->bookNo, q->rear->bookName); return 0; b) Write a function named dequeue () that removed the element in the queue.