Theorem $[$Quine$]$: Given any Boolean function f$,$ there exists a minimum cover for f that is prime.

For the purpose of this question, you may assume that a $$minimum$$ cover is one that has the lowest

number of product terms among all covers. Optionally, you may also choose to prove a stronger version of

the theorem by defining a $$minimum$$ cover to mean one that has the lowest number of literals.