Problem 4: A ternary search algorithm searches a sorted array "a[1...n]" of n integers for a certain search target t by comparing t to a[third], where third-(1+n)/3. Ift equals a[third], the search concludes with TRUE. Otherwise, if t> a[third], the search procedure repeats for the upper two thirds of the array, and the same for the lower third if t