Consider a sorted array of 5 items on which searches are madewith probabilties of match distributed as 0.3, 0.25, 0.2, 0.15, 0.1. Would the average number of comparisons for success be better with binary search or sequential search applied on optimal rearrangement of the items