HW 8 Divide and conquer algorithm for finding min and max at same time soution

Implement the algorithm discussed on page 325, problem 7.40 (Weiss text).
The shell of the program and an object (MinMax) are provided.
Please read the code carefully and add all required comments as well as code.
A test driver (main method) is provided for you – modify it as necessary to test your
program. When you submit, make sure that the provided test driver code is in your main
(even it if is commented out) with what ever other test code you wish to use to show what
What to submit: Submit only the HW8.java file to OAKS no later than Tuesday, August
11, 10:00pm.
NOTE: start ASAP, the divide and conquer idea will be discussed in Monday’s (August 10)