(25 pts) A machine can perform a task on a vector of length X1 with log(X) operations. Given a sequence of IID tasks, of lengths X1,,Xn, the total number of operations is defined as: Y=i=1nlog(Xi) Use Jensen's inequality to give an upper bound for E[Y], using n=10 and E[X]=100. (25 pts) In the previous exercise, also give an upper bound for the probability that Y is 1000 or more