Algorithm sequential_(T[1..n],x) from Section 7.3 (Fundamentals of Algorithmics pp. 226 - 227) finds some element x in array T[1n]. Assuming the x is somewhere in the array, the elements of T are distinct, and that, x can be found with equal probability at each possible position, prove that (n+1)/2 is the average number of trips round the loop.