Devise an algorithm that takes a list of n > 1 integers and finds the largest and smallest values in the list. What is the best O-notation for your algorithm? Why?

step-by-step explanation:

d. 24+-0.114

step-by-step explanation:

the question requires us to calculate the approximate 95% confidence interval for the mean number of ounces of ketchup per bottle in the sample given the following statistics;

sample mean = 24

standard deviation, σ = 0.4

sample size , n = 49

the confidence interval for a population mean is calculated using the formula;

sample mean ± z-score*(σ/sqrt(n))

the z-score associated with a 95% confidence interval, from the standard normal tables, is;

1.96

substituting these values into the formula;

24 ± 1.96*(0.4/7)

= 24 ± 0.112

from the alternatives given, choice d is closest to the above expression;

- both graphs increase on their domain.

- the graphs of both functions have the same x-intercept.

- neither graph has a y-intercept.