Examine the procedural aspects of implementing a Circular Array for a Queue. Given an array with a maximum size of $8$ and the current elements $(100,20,30,40,600,80),$ illustrate the current positions of the first and last pointers. Add the elements $45$ and $56$ to the queue and utilize modular arithmetic to demonstrate the updated position of the last pointer. Furthermore, perform the deletion of the first element and showcase the new position of the first pointer after the operation. $(20$ pts$)$