Given the algebraic function: f(x) = x² + 3x + 8; 1 x 9 How many input bits would be required to implement f(x) form using Shannons Theorem?________

How many output bits would be required to implement f(x) form using Shannons Theorem? _______

Given the following logical functions:

To implement the functions G₁ and G₀ on a gate-level will require a total of:

____________ gates and __________ literals.

To implement the functions G₁ and G₀ using decoder size _________ with no enable lines will require a total of ____________ gates and __________ literals.

To implement the functions G₁ and G₀ using MUX size _________ with 2 enable lines will require a total of ____________ gates and __________ literals.