Suppose a circular queue of capacity $($n $-1)$ elements is implemented with an array of n elements. Assume that the insertion and deletion operation are carried out using REAR and FRONT as array index variables, respectively. Initially, REAR $=$ FRONT $=0.$ The conditions to detect queue full and queue empty are.. Option $1)$ Full: $($REAR$+1)$ mod n $==$ FRONT, empty: REAR$==$FRONT.Option $2)$ Full: $($REAR$+1)$ mod n $==$ FRONT, empty: $($FRONT$+1)$ mod n $==$ REAR.Option $3)$ Full: REAR $==$ FRONT, empty: $($REAR$+1)$ mod n $==$ FRONT.Option $4)$ Full: $($FRONT$+1)$ mod n $==$ REAR, empty: REAR $==$ FRONT.Option $5)$ None of the above