which of the following algorithms is correct to insert element into the queueSelect one:a$.1-$Initialize front$=0$ rear $=12.$ Input the value to be inserted and assign to variable data $3.$ If $($rear $<=$ SIZE$)($a$)$ Display Queue overflow $($b$)$ Exit $4.$ Else $($a$)$ Rear $=$ rear $+15.$ Q$[$rear$]=$ data $6.$ Exit