Write a program that creates a FIFO queue and prints some values. use structures, pointers to structures and the malloc function. Use the values from the array included in the code fragment. Create one element of a queue for one element of an array (there are 10 elements). After you have created the list, print the first 5 values of the queue and then the first 7 values of the queue. After this you must free up the memory. After all the operations have been completed, print the message: "Memory is freed".

#include stdio.h

#include stdlib.h

struct element { int value; struct element *next; };

int main(void) {

int values[10] = { 2, 4, 5, 6, 7, 8, 9, 1, 3, 0};

return 0; }