Write your OWN CLASS for realization one of data structure - Queue, Stack, Singly linked list, Doubly linked list, Circular list, Random access array.

Develop a program that reads from the keyboard sequence of N unique integers N (1

- number of elements;

- average of saved items;

- minimum and maximum element;

- fourth element of the sequence;

- element that is before the minimum element.

We emphasize that all the characteristics necessary must be define for a filled data structure. Only those operations that are inherent to given structure are allowed, for example, one must not access an element on an arbitrary position in a queue which is based on an array. Usage of ready data structures (e.g., STL) is prohibited. with C++ and a diffrent answer from the one posted from previously