(Solved): Please complete solution in java using recursion, Thankyou! Q1: Find Missing Number (2 points) Con ...

Please complete solution in java using recursion, Thankyou!

Q1: Find Missing Number (2 points) Convert the following pseudocode algorithm into Java. You'll find example tests within the main method to ensure you're headed in the right direction. Make sure you understand each example. algorithm findMissing Input: integer array \( \mathrm{A} \) of length \( \mathrm{N} \) where each element is distinct and in the range \( [\mathrm{O}, \mathrm{N}] \) Output: integer \( \mathrm{x} \) where \( \mathrm{x} \) is in the range \( [0, \mathrm{~N}] \), but not in \( \mathrm{A} \) \( s= \) the sum of all numbers in \( A \) return \( (N(N+1)) / 2-S \) public static int findMissing(int[] arr) \{ throw new Unsupported0perationException ("findMissing not yet written");