https://learn.zybooks.com/zybook/VALDOSTACS1302MihailSpring2024/chapter/14/section/11 import java.util.Scan X FREE AI Java Code zy Section 14.11-CS Dashboard G Google Homepage - Princip X Georgia Gateway + A ☆ [] " + $ Help/FAQ • Marlon Barrera Rondon = zyBooks My library > CS 1302: Principles of Programming II home > 14.11: LAB: Unique random integers (HashSet) Given integer inputs howMany and maxNum, generate an array of howMany unique random integers from 0 to maxNum (exclusive). The structure of the program is: 19°C Mostly cloudy • main() calls uniqueRandomInts() with arguments howMany and maxNum. • uniqueRandomInts() returns an array of howMany unique random integers. • The required output is already provided in main() and printNums(). Complete uniqueRandomInts(), which generates random integers until howMany unique integers have been collected in array nums. Hint: If a generated number is new, add the number to the array nums and the set alreadySeen. If the number has been seen before, increment the static variable retries and generate another random integer. Note: For testing purposes, a random number generator object is created with a fixed seed value (29) in unique RandomInts(). Refer to the textbook section on Random numbers to learn more about pseudo-random numbers. Ex: When the input is: 5 8 the output is 50 17 3 [3 retries] 555804.3482728.qx3zqy7 LAB ACTIVITY 14.11.1: LAB: Unique random integers (HashSet) 0/10 LabProgram.java Load default template... 1 import java.util.Scanner; 2 import java.util.HashSet; 3 import java.util.Random; 4 5 public class LabProgram { 7 9 10 // Print the numbers in array separated by a space public static void printNums (int[] nums) { for (int i = 0; i < nums.length; ++i) { System.out.printf("%d ", nums[i]); 11 } 12 } 13 Q Search 9:33 AM 4/18/2024