Suppose the list has an odd number of items, say 15. at what position is the middle item? using sequential search, how many comparisons are required to find the middle item? repeat this exercise with a few more odd numbers until you can do the following: if there are n items in the list and n is an odd number, write an expression for the number of comparisons required to find the middle item.
(c, 0) i might be wrong so don't put full faith on my answer
i dont know
option (b) is correct
to find the solution of this system, we need to convert it into reduced row-echelon form. we have,
after applying row operations r2 -> r2/2 and r3 -> r3/3, we get,