Question 26 1 pts If a binary search algorithm was given an unsorted array and asked to find the value val, which of the following is true o it is guaranteed to find val o It is guaranteed to never find val o it will get a stack overflow It might find val Question 20 1 pts Consider the following method: public void writeIt(String input) { if (input. length == 1) { System.out.println(input); else { System.out.println( input.substring(input. length(-1) writeItc input.substring(0, input.length(-1) ; System.out.println( input.substring(input.length(-1) Note that s.substring(n) creates a substring from s starting a position n, ie if s = "abcdefg" then s.substring(3) = "defg". s.sbustring(m, n) creates a substring from s starting at position mand up to but not including position n, ie s.substring(1. 4) ="bcd". What will be the output for a method call writeIt("abc"); ? 000