2. Given the program below to implement a circular queue from linked list, fill the empty spaces numbered up to 14, with necessary code. #define MAX 6 struct queue int data: struct queue link: struct queue front - NULL) 1/03 struct queue rear - NULL;/13 struct Gueue "Q - NULL} int ItemCount - bool ismpty() { return bool IsFollo) (return int size() { return... (3)) (2) int peek() If (istmpty()) return -1; else return void insert(int data) if (lasFull) if (rear -- NULL) rear- ..(5)//write code to make it circular queue else rear - (6) rear->data -(7) (8)//what to do with itencount? int removebata() { int data = -1