(a) Minimise the following logic function using the Karnaugh maps method: f(a, b, c) = a'b + bc + be + ab'd (b) Given the following logical circuit with three inputs A, B and C: Do i. Use the boolean algebra notation and write down the boolean expression of the output, Q of this circuit. ii. Simplify the logical expression in (i). Explain your answer. (c) Let f be a function R - {-3} - R - {1} with f(x) = 24 i. Show that f is a bijective function ii. Find the inverse function f-1 iii. Plot the curves of both function f and f-1 on the same graph. iv. suppose we change the co-domain of the function f to be IR: f : R- {-3) - R v. Is f still a bijective function? Explain your answer. (d) How many binary sequences of length 8 start with a 1 and end with a 0