Which of the following statement is/are not true?

I. First-in-first out types of computations are efficiently supported by stacks.

II. Implementing queues on a linear array with two indices is more efficient then implementing queues on a circular array.

III. The best data structure to check whether an arithmetic expression has balanced parenthesis is a queue.