Starting with an empty priority queue, represented as heap, draw the heap that results from: enqueue 14 enqueue 16 enqueue 18 enqueue 10 enqueue 19 enqueue 40 dequeue

130-4

Establish a linked queue, and run operations in the linked queue. General operations include：Create queue, one element enqueue, one element dequeue, check if the queue is full. Implementation of algorithm Header file typedef int DataType;   typedef struct Node {             DataType data;             struct Node *next; }Lnode; //define node type   typedef struct Qu {             Lnode *front;             Lnode *rear;      } Queue;//queue type   Source file #include <stdio.h> #include <stdlib.h> #include <string.h> #include <malloc.h> #include "queue.h"   Queue * Initiate_queue()//Initial queue with head node, return pointer of the queue. {               }   int Queue_empty (Queue *queue)//Check if the queue if empty. If it is empty return 1 else return0. {               }   void En_queue(Queue *queue, DataType node)//Enqueue {                         }   DataType De_queue(Queue *queue)//Dequeue a node, return its value. {             Lnode *de_node;…