We looked at a greedy algorithm to solve the set cover problem, and proved that if the optimal set cover has size k, then our greedy algorithm will find a set cover of size at most k loge n. here is a generalization of the set cover problem. • input: a set of elements b of size n; sets ; sm b; positive weights wi; . • output: a selection of the sets si whose union is b. • cost: the sum of the weights wi for the sets that were picked. design an algorithm to find the set cover with approximately the smallest cost. prove that if there is a solution with cost k, then your algorithm will find a solution with cost o(k logn).

an advantage of the standard deviation is that it increases as the dispersion of the data increases. e. the interquartile range is preferred when the data are not skewed or no have outliers. an advantage of the standard deviation is that it uses all the observations in its computation.

answer: -2+√x,-2-√x

i hope this , i don't know if you're looking for a pair or not.

solve systems of equations by graphing. a system of linear equations contains two or more equations e.g. y=0.5x+2 and y=x-2. the solution of such a system is the ordered pair that is a solution to both equations. to solve a system of linear equations graphically we graph both equations in the same coordinate system

a.)the line for function b is steeper