Suppose we have a circular array implementation of the queue class, with ten items in the queue stored at data$[2]$ through data$[11].$ The current capacity is $12.$ Where does the insert method place the new entry in the array?

data$[1]$

data$[11]$

data$[12]$

data$[0]$