math logic

Determine which of the given systems F and G of Boolean functions is complete in P2. For the complete system illustrate the proof of Post theorem, i.e. express both constants, negation and conjunction as a superposition of functions from the system. Draw a circuit (scheme of functional elements) realizing them. F = {p(x, y, z) = ry Vz, m(x, y, z) = ry erzyz, w(1) = 0. i(x) = 1}, G = {f(x) = (10), 5(1,9, ) = (00110111), h(x, y, z) = (10110001)}, For the function f construct its PDNF, for its PCNF, and for h-its Zhegalkin polynomial. 9