In section 7.3 of you text, there is a program on pages 325 and 326 called LargestInArray.java. For this problem you will modify this program to find both the largest value (the code is already written) and the smallest value (this is the code you will write). Add the necessary code to show both the largest and the smallest values.

import java.uti1.Scanner; This program reads a sequence of values and prints them, marking the largest value. public class LargestInArray public static void main(String[] args) final int LENGTH = 100; double[] valuesnew double LENGTH] int currentSize0; // Read inputs System.out.println("Please enter values, Q to quit:"; Scanner in = new Scanner(System.in); while (in.hasNextDoubleO && currentSize largest) largestvaluesi] d Array Lists Print all values, marking the largest for (int i 0;