a Let S be the unit square: 3={(2,y) 10

Let S be the unit square: S : 1, O Sys 1} Suppose we approximate a: dA by n prisms whose bases are rectangles of length 1 in the L in the y-direction x-direction and width ow could you pick test points in each rectangle to ensure that the value of this approximation is O, no matter what n is? ow 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 how many rectangles dA does not exist? Explain we use mean that