A common problem in compilers and word processors is determining whether the parentheses in a string are balanced and properly enclosed one within one. For example, the string ((( ) ) ( ) ) ( ) is well-balanced and cleanly written. But the strings )( )( or ( ) ) are not. 1. 

Write a Java program that prints TRUE if a string is properly written and balanced, and FALSE otherwise. Use a battery for this.
 

Exercise II 

public interface Queue { 

void enqueue(E elem);  

 E tail(); 

boolean isEmpty(); 1.
}

Propose an implementation of the CircularQueue class that implements the Queue interface.

 

If the circular queue is full, the program should resize the array size by creating an array of twice the capacity of the initial array capacity. The program must copy the elements of the old array into the new array.