Hello, I need a circular buffer and I need the code to be inside the code that I sent and the last one is for the main.

Thanks in advance.

urse In this task, you will define circular linked list data structure, and then further modify it to work as a circular buffer Problem Description: A circular linked list is a list that has no end or beginning: the tail node points to the head node, creating a loop of nodes. Such a data structure can be useful in storing the points of a polygon, for example, or for creating a circular buffer that stores data items that must be processed in some way eg. jobs to be serviced in a first-in-first-out fashion In the buffer application, data items are added on one end of the buffer and removed from the other end. Every time a data item is removed, the buffer has one more empty slot. And every time a data item is inserted, the buffer has one less empty slot. Insertion and deletion must check the status of the buffer (lempty/ful circular linked list works extremely well to implement a circular buffer. Once the buffer is allocated (in the class constructor), no additional space needs to be allocated for the structure. Additionally, the buffer only needs to add arn for processing, remove an item to process it, and optionaly return the size or status of the buiffer All o these operations can easily be done in constant time using the circular inked is In this assignment, you are to define a class that that can be used as a circular buffer structure The partilly implemented circular Bufferh fle below, contains the the class specification for the circularBuffer class. Implement each method of class circularBuffer in the same file. te a program to test your implementation of class clircularBuffer. You may use the program in file testCircularBuffer.cpp to test your implementation Note: You should implement and test class circularBuffer incrementally: start by creating function stubs for all class methods, then implement and test each method one by one. 80888 F6 FIO 0