If we do not cache the size of a circular queue, we can check that it is empty by:

Select one:

keeping an empty space, and checking if the tail modulo the capacity is zero.

keeping an empty space, and checking if the head is equivalent to the tail.

keeping an empty space, and checking if there is None stored at the tail.

all of the above.