How do I solve this problem?

- Let 5' be the unit square: S={[I.y):5.r51.s:u

Let S be the unit square: Suppose we approximate x dA by n prisms whose bases are rectangles of length 1 in the x-direction and width in the y-direction How could you pick test points in each rectangle to ensure that the value of this approximation is O. no matter what n is? HOW could you pick test points in each rectangle to ensure that the value Of this approximation is 1, no matter what n is? Does the fact that both of these approximations are possible no matter ho. many rectangles use mean that x dA does not exist? Explain.