If n(A) = P and n(B)=q then n(AxB) is (a ) p (b ) q ( c ) p+q ( d ) pq

By way of example, suppose A = {1, 2, 3} and B = {a, b, c}. Then the Cartesian product of A and B is

A × B = {{1, a}, {1, b}, {1, c}, {2, a}, {2, b}, {2, c}, {3, a}, {3, b}, {3, c}}

That is, each element in A gets a pairing with each element in B, and for each pairing you have n(A) choices for the first element and n(B) choices for the second element.

So if n(A) = p and n(B) = q, then n(A × B) = pq.

oof cheaters cheat because they’re lazy that’s why i cheat xd

: )

step-by-step explanation:

if a = 1,   and b = 2, then the answer is 47.99999999. if you round that to the nearest whole number, the answer is 48.