Data Structures and Algorithm Question: Average insertion time to a dynamically expanding list (a) What is the worst case for insertion? (b) What is the runtime of insertion in the worst case? (c) What is the runtime of insertion in average and why?

Need help with the questions provided below.

Objective  Define a circular buffer data structure and test it. Problem Description: A circular buffer (also called a circular queue) is circular list of nodes where data items are added on one end of the buffer and removed from the other end. Because the nodes form a circular list, the list has no end or beginning: the tail node points to the head node, creating a ring of nodes.   You may think of the nodes as containers or slots that are all initially empty but can be assigned a value in their data field info.   Every time a new data item is inserted (inserting to a buffer is often referred as Writing), one slot is filled and the buffer has one less empty slot. Every time a data item is removed (referred to as Reading), the buffer has one more empty slot.  Since the list has no beginning and no end, a pointer (writeIndex) is used to mark the next empty slot to write to and a second pointer (readIndex) is used to mark the next node to read from.  The readIndex/writeIndex must be…

i need the answer quickly