please as soon as possible. it"ll be highly appreciated.

QUESTION 5 Which ones are wrong? Binary Search runs in O(n) time. Tail recursion could be any kind of recursion. The base case for the factorial function is when n equals 0. The recursive reverse-array method could be converted to a non-recursive version. +