i can do the karnaugh maps easily no problem, but i'm having difficulty using the Quine-McCluskey algorithm for f and g

A numeric keypad produces a 4-bit code as shown below. We want to design a logic circuit that converts each 4-bit code to a 7-segment code, where each segment is an LED: A LED is ON if it is given a logic'1'. A LED is OFF if it is given a logic '0. Complete the truth table for each output (a, b,c, d, e,f.g) Provide the simplified expression for each output Hoekemauch mapsfo-, and the Quine- McCluskey algorithm for f.g. Note it is safe to assume that the codes 1010 to 1111 will not be produced by the keypad 9 Value X Y Z W a b cde f g 0 1234 1 0 0 0 1 3 0 1 0 0 0 1 0 1 011 0 0 1 1 1 6 7 1 0 1 0 1 0 1 1 1 1 0 0 1 1 0 1 1 1 1 0