Define a function expo that performs this task, and state its computational complexity using big-0 notation.
complete questions only 1- 3 Projects 1. A sequential search of a sorted list can halt when the target is less than a given element in the list. Define a modified version of this algorithm, and state the computational complexity, using big-0 notation, of its best-, worst-, and average-case performances. 2. The list method reverse […]