TRUE/FALSE
1. A general case of a valid recursive algorithm must eventually reduce to a base case 2. Recursive methods must always contain a path that does not contain a recursive call. 3. In a non-empty queue, the item that has been in the queue the longest is at the rear of the queue 4. The first element to be stored in a queue is also the first element removed from the queue 5. Our UnboundedQueueInterface extends our BoundedQueueInterface. 6. It is not possible to implement the UnboundedQueueInterface using an array based approach.