Count the best-case number of + operations performed by the following pseudocode segment. Assume that all possible data sets are equally likely.

Preconditions: X = {x1, x2, x3, x4, x5} {10, 20, 30, 40, 50, 60, 70}, where x1 < x2 < x3 < x4 < x5.

t 0

i 1

while t < 101 do

t t + xi

i i + 1