Consider the following pseudo code:

Which of the following statements are true about function goo() I) If b is not in A, goo will run into an infinite loop II) if b is not in A, goo will return -1 III) goo() will always return maximum element in A IV) goo() is similar to a binary search