Please do in Java

WITH 2.1.29 Binary search. A general method that we study in detail in SECTION 4.2 is effective for computing the inverse of a cumulative probability density function like Phio. Such functions are continuous and nondecreasing from (0,0) to (1,1). To find the value x, for which f(x) = Yo, check the value of f(-5). If it is greater than you then x, must be between 0 and .5; otherwise, it must be between 5 and 1. Either way, we halve the length of the interval known to contain xp. Iterating, we can compute X; to within a given tolerance. Add a method Phi Inverse to Gaussian that uses binary search to compute the inverse. Change main to take a number p between 0 and 100 as a third command-line argument and print the minimum score that a student would need to be in the top p percent of students taking the SAT in a year when the mean and standard deviation were the first two command-line argu- ments. WITH 2.1.29 Binary search. A general method that we study in detail in SECTION 4.2 is effective for computing the inverse of a cumulative probability density function like Phio. Such functions are continuous and nondecreasing from (0,0) to (1,1). To find the value x, for which f(x) = Yo, check the value of f(-5). If it is greater than you then x, must be between 0 and .5; otherwise, it must be between 5 and 1. Either way, we halve the length of the interval known to contain xp. Iterating, we can compute X; to within a given tolerance. Add a method Phi Inverse to Gaussian that uses binary search to compute the inverse. Change main to take a number p between 0 and 100 as a third command-line argument and print the minimum score that a student would need to be in the top p percent of students taking the SAT in a year when the mean and standard deviation were the first two command-line argu- ments