2. Define IsPredicate(IP )={f for each x,f(x) evaluates to 0 or 1}. a.) Show some minimal quantification of some known primitive recursive predicate that provides an upper bound for the complexity of IP b.) Use Rice's Theorem to prove that IP is undecidable. Be Complete. c.) Show that TOTAL ={fxf(x)} is many-one reducible to PP. d.) Show that PP is many-one reducible to TOTAL={fxf(x)}