Give a big-o estimate for the number of operations (where an operation is an addition or a multiplication) used in this segment of an algorithm. t : = 0 for i : = 1to3 for j : = 1to4 t : = t + ij

Asystem of linear equations with more equations than unknowns is sometimes called an overdetermined system. can such a system be consistent? illustrate your answer with a specific system of three equations in two unknowns. choose the correct answer below. a. yes, overdetermined systems can be consistent. for example, the system of equations below is consistent because it has the solution nothing. (type an ordered pair.) x 1 equals 2 comma x 2 equals 4 comma x 1 plus x 2 equals 6 b. no, overdetermined systems cannot be consistent because there are fewer free variables than equations. for example, the system of equations below has no solution. x 1 equals 2 comma x 2 equals 4 comma x 1 plus x 2 equals 12 c. yes, overdetermined systems can be consistent. for example, the system of equations below is consistent because it has the solution nothing. (type an ordered pair.) x 1 equals 2 comma x 2 equals 4 comma x 1 plus x 2 equals 8 d. no, overdetermined systems cannot be consistent because there are no free variables. for example, the system of equations below has no solution. x 1 equals 2 comma x 2 equals 4 comma x 1 plus x 2 equals 24