what is the average complexity of sequential search if there is a $0\mathrm{.}25$ chance that the target will not be found in the list and there is a $0\mathrm{.}75$ chance that when the target is in the list, it will be found in the first half of the list?