Let A be an array of size n ≥ 2 containing integers from 1 to n −1, inclusive, with exactly one repeated. Describe a fast algorithm for finding the integer in A that is repeated.   Experimentally...

Let
A
be an array of size
n
≥ 2 containing integers from 1 to
n−1, inclusive,

with exactly one repeated. Describe a fast algorithm for finding the

integer in
A
that is repeated.

Experimentally evaluate the efficiency of the pop method of Python’s list

class when using varying indices as a parameter, as we did for insert on

page 205. Report your results akin to Table 5.5.