discrete math

(15) 3. Analyze the worst-case, best-casc, and average-casc number of comparisons of sequential search if exactly three-sevenths of the time, the element x to search for is not in the list and if x is in the list, it is equally likely to be in any position. a. Worst-case number of comparisons b. Best-case number of comparisons c. Average-case number of comparisons Show your work for part c here