=========

try to get help from hw java

must explain each steps to get point

Anna P 9 UE= New Mirror Word Document - X Search Fle Home Insert Design Layout References Malings Review View Help Share Comments X Cut Find Calibri Body) 14 A A A A. 211 COM AaBbcc AalbCD: Alba AaBbccc AaB AaBbce Acbcc 4oBCED Arbor Aalbcd4aebcco ABC LABECEDC AABBCODE 1 Normal 1 No Spac. Heading 1 Heading 2 Subtle Em.. Emphasis Emphas intense Intense. Subtle Het Interse Re. Strile Iden Strong Quote Sduct 3 Format Panter Clipboard For Paragrach Edring Edite algorithm find Missing Input: Integer array A of length N where each element is distinct and in the range Co, N] Output: integer x where x is in the range [ON], but not in A s = the sum of all numbers in A return (N(N+1)/2-5 public class HW1 public static void main(String[] args) { // 1 int testResult1 = find Missing new int[] {0, 1, 2, 4,5}); System.out.println(testResult1); // should output 3 int testResult2 = find Missing new int[] {5, 0, 4, 3, 1}); System.out.println(testResult2); // should output 2 int testResult3 = find Missing new int[] ()); System.out.println(testResult3); // should output o int testResult4 = find Missingew int[] {9,3,5, 1, 4, 8, 2, 10, 0,6}); System.out.println(testResult4); // should output 7 public static int find Missing(int[] arr) { throw new Unsupported OperationException"find Missing not yet written"); } * Add your key ideas to this comment. * How did you approach the problem? * Why does your code work? *7 Pape 1 of 1 157 wurds ng United Staal Crocus 110% BON D O E w AO LNG 104001