Write a java program that performs n operations (find, insert, and delete Strings) on AVL tree and tracks the performance (hint: System.currentTimeMillis()). Your program must have at least one class called Driver2 which runs the program. This classes should have a no argument constructor and implement the following interface.

public interface BalancedTree> {

public void insert(E item);

public E find(E item);

public void delete(E item);

public void printInOrderTraversal();

public int isWellFormed();

}

The isWellFormed() method checks the AVL tree if it follows the appropriate rules (0 for true and 1 for false).