3.2 Implementations of Queues The physical model: a linear array with the front always in the first position and all entries moved up the array whenever the front is deleted o Alinear array with two indices always IncreasIng b a circular array with front and rear indices and one position left vacant3.2 Implementations of Queues The physical model: a linear array with the front always in the first position and all entries moved up the array whenever the front is deleted. A linear array with two indices always increasing. A circular array with front and rear indices and one position left vacant