If possible please solve using LogicAid. I do not understand how to solve this using the software.

Use the KMap Tutorial of LogicAid to find a minimal sum of products and a minimal product of sums for each one of the following Boolean functions: g(a, b, c, d)= sigma m(0, 3, 5, 7, 8, 9, 10, 12, 13) + sigma d(1, 6, 11, 14). h(a, b, c) = sigma m(0, 2, 6,v 7) + sigma d(1, 3). f(a, b, c, d) = pi M(0, 2, 4, 6, 8). Pi d(1, 9, 12, 15)