Indicate whether the statement is true or false. A general case of a valid recursive algorithm must eventually reduce to a base case. Recursive methods must always contain a path that does not contain a recursive call. In a non-empty queue, the item that has been in the queue the longest is at the rear of the queue. The first element to be stored in a queue is also the first element removed from the queue. Our Unbounded Queue Interface extends our Bounded Queue Interface. It is not possible to implement the Unbounded Queue Interface using an array based approach. Our linked implementation of queues implements a bounded queue. When comparing two objects using the = operator what is actually compared is the contents of the objects. The size of a list is a fixed value, i.e., it does not change over time. A method within a class defined as protected can be called by an application that instantiates objects of that class. Identify the choice that best completes the statement or answers the question. int example (int n) { if (n == 0) return 0; else return example (n - 1) + n*n*n; } What does the example method do, when passed a positive int n? Returns the cube of the number n. Returns one less than n plus the cube