Write a c program to implement a circular queue with a capacity of 5. The front (F) is positioned at index 2, and the rear (R) is positioned at index 4 and the queue is initially populated with elements 10, 20, and 40, where. After inserting 50 and 60, what is the value of F and R. Trying to insert 30 at this stage, what happens? Delete 2 elements from the Queue and insert 70, 80. Show the sequence of steps with the value of F and R.  Hint if the Queue is Full Print Queue Full