I need help setting up the truth table for this problem

A logic circuit design has 4 input a, b, c, d, and 2 outputs. The four inputs a, b, and c, and d, are binary representation of the digits 0 through 15 We have 2 outputs O for odd parity, and E for even parity. The output functions correspond to the number of I's has a value of 1 if the input digit is a prime number (1 is considered to be a prime number). Draw a K-map for functions O and E Simplify to SOP and Pos Simplify further using Boolean Algebra if possible > Design the combinational gates with the least number of gates