Write a program to implement the concept of queue with size $3.$ Demonstrate the following operations:

$(2$ marks$)$

insert$($A$)$; insert$($B$)$; delete$()$; display$0$; delete $0$ ; insert$($C$)$; display $0$ ;