Assignment 1- Implement an array that initialize a one dimensional array with a set of n finite numbers. Then implement the traversing, insertion and deletion operations on the array. 2- Implement a queue with n elements. First inserting n elements into the queue, then displaying all elements of the queue. Finally empty the queue. 3- Implement a linked list that stores information (its type and number are optional) in the linked list. Include all the mentioned operations except operation concatenation in the code