Given the integer array dailyTemps with the size of NUM$\_$VALUES, write a for loop that sums each integer of dailyTemps together until either maxSum is greater than or equal to $150$ or the end of the array is reached.

Ex: If the input is $816151171210131,$ then the output is:

Maximum sum: $93$ import java.util.Scanner;

public class MaxQuantityCalculator $\{$

public static void main$($String$[]$ args$)\{$

Scanner scnr $=$ new Scanner$($System$.$in$)$;

final int NUM$\_$VALUES $=9$;

int$[]$ dailyTemps $=$ new int$[$NUM$\_$VALUES$]$;

int i;

int maxSum;

for $($i $=0$; i $<$ dailyTemps.length; $++$i$)\{$

dailyTemps$[$i$]=$ scnr$.$nextInt$()$;