$(2,5,8,11,15,18,23,29,31,35)$

In searching for a target item x that is in the list, the running time of the algorithm may differ$$ depending on which item from the list is the target. Give a target item x$,$ selected from the list, that$$ results in the best running time. Given a target item, selected from the list, that results in the worst$$ running time.$$