Problem $3-$ Exercise $32\mathrm{.}15(15$ points$)$

$($Parallel Sum$)$ Implement the following method using Fork$/$Join to find the sum of a list.

public static double parallelSum$($double$[]$ list$)$

Write a test program that finds the sum in a list of $9,000,000$ double values.

Also create a sequential sum method called sequentialSum$().$ In the main$()$ method, time how long it takes for each sum method to run and display the time for each. Also, display the sum $($result$)$ from each sum method. $($See ParallelMax.java for how to track time and on how to declare and initialize each element of an array of $9,000,000$ double values to $1.)$