Consider the following alteration to the binary search algorithm. Note that a[i:]] denotes a slice of the array from index i to index j, inclusive. Algorithm trinarySearch(a, num) : Input: an array a of n sorted integers and an integer num Output: the index of num in the array or -1 if num does not appear in the array if(a.length 0, which is acceptable since clog N + 1 is O(logN).)