Count work under stated assumptions - Paper 2

Read before answering

Sorted list [1,5,9,13,17,21,25,29], target 1. Linear search visits from index 0. Binary search starts low=0, high=7, takes mid=floor((low+high)/2), and moves low to mid+1 or high to mid-1. Stop on equality or an empty interval. Count one inspected element per visit, not individual machine operations.