### Objective

To gain experience working with multi-threaded programming.

For this lab, you will parallelize a sequential algorithm. This Search.java program contains a class called Set. This class has an add method for adding names to the set, and an exists method for testing whether an element is in the set.

The main class creates a Set, adds 100 names to it, and then tests 10 names for membership in the set.

Your task is to change the "exists" function so that it splits the work into two independent threads. You can do this by having one thread search the first half and the second thread search the second half.

In order to make sure you are really parallelizing the search, you should have the thread print a message with its thread number when it finds the name.

### Testing

Your program should find every other name on the list. The original program produces the following:

Ivy exists: true.
Mark exists: false.
Pearl exists: true.
Georgette exists: false.
Simone exists: true.
Bobby exists: false.
Roland exists: true.
Agatha exists: false.
Luz exists: true.
Herman exists: false.


The behavior of your program should be identical, but should also include which thread found the name, like this:

Thread 2 found the name.
Ivy exists: true.
Mark exists: false.
Pearl exists: true.
Georgette exists: false.
Simone exists: true.
Bobby exists: false.
Roland exists: true.
Agatha exists: false.