1. Define PredicateLike(PL) ={f for each x,f(x) either diverges or 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 PL. b.) Use Rice's Theorem to prove that PL is undecidable. Be Complete. c.) Show that Diverge ={f,xf(x)} is many-one reducible to PL. d.) Show that PL is many-one reducible to Diverge ={f,xf(x)}