1. True/False. An array dynamically grows as needed and essentially has no capacity limitations.

2. True/False. If the algorithm is inefficient, a faster processor will make it very efficient.

3. True/False. A linked list has no set capacity limitations other than the size of the computers memory.

4. True/False. A singly linked list maintains a reference to the first element in the list and then a next reference from each node to the following node in the list.

5. True/False. Postfix notation avoids the need for precedence rules that are required to evaluate infix expressions.

6. True/False An abstract data type is a data type that is not defined within the programming language and must be defined by the programmer.

7. True/False. The new operator returns a reference to a newly created object.

8. True/False. Objects should be encapsulated. The rest of a program should interact with an object only through a well-defined interface.

9. True/False. Instance variables should be declared with public visibility to promote encapsulation.

10. True/False. A constructor cannot have any return type, even void.

11. True/False. A class is the implementation of the blueprint for an object. An object is a specific instance of a class.

12. True/False. Overloaded methods are distinguished from each other by their signatures including the number and type of the parameters.

13.Convert the following to postfix expression

(9+2) / (6*7 2)