A Boolean function fk of two variables A and B is defined as follows: fk (0, 0) = fk (0, 1) = fk (1, 1) = 1; fk (1, 0) = 0 Assuming complements of A and B are not available, what will be the minimum...

A Boolean function fk of two variables A and B is defined as follows:
fk (0, 0) = fk (0, 1) = fk (1, 1) = 1; fk (1, 0) = 0
Assuming complements of A and B are not available, what will be the minimum cost solution for realizing using only 2-input NOR gates and 2-input OR gates (each having unit cost) ? Explain with nessessary digram and expression