1 - Write a C library of methods to manipulate a queue of integers, using the structured programming paradigm. As you know, a queue is a FIFO (first in first out) data structure, and a complete set of methods should at least include a function to get the current size of the queue, a method to enqueue (add a new integer to the queue), and a method to dequeue (retrieve the next item in the queue). Note that the queue should have unlimited capacity, that is it should grow in size as required. After implementing the library, you should use it to write a C program that allows a user to perform the following operations as many times as he likes: a) Add an integer to a queue b) Retrieve the next integer from the queue c) Retrieve the current size of the queue d) Display all elements in the queue For this program, create an empty project in Visual Studio and try to stick strictly to the C language, meaning that you should avoid C++ added features like using references instead of pointers or advanced libraries. 2-Write a C++ program to perform the same tasks outlined on problem 1 but this time use an object oriented approach. In this case you should write the library as a set of one or more objects that you can reuse. After you are done, write a paragraph explaining your impressions of applying the two different paradigms to solve the same