F(A, B, C, D) = m(1, 3, 4, 5, 10, 11, 12, 13, 14, 15)

i. Simplify the above function using the 4-variable K-Map to determine the minimum sum of products (minSOP).

ii. Simplify the above function using the 4-variable K-Map to determine the minimum product of sums (minPOS).

iii. Compute the cost of minSOP and minPOS solutions in terms of Literals, Number of Gate Inputs, and Number of Gate Inputs with NOTs. Which solution is the best in terms of Number of Gate Inputs with NOTs?