(a) What is the maximum number of pairs a single test case for this system can cover?
"I know that there are m^n different combinations in this example, but i'm unsure how many pairs a single test case could cover."
(b) In the best case, how many test cases can provide full pairwise coverage?
(c) Calculate the total number of pairs the test suite must cover.
(d) Suppose that n = 13 and m = 3. What is the minimum number of test cases to be selected to achieve pairwise coverage?
"I know there are 1594323 (3^13) different combinations, but i'm not srue the min of test cases".