4. A term in the first-order language of arithmetic is defined inductively as follows: . 01s a term, .1 is a term, lw] is a term, whenever w is a number (written in binary), . if ti and t2 are terms, then t +t2 is a term, and . if t1 and t2 are terms, then ti x t2 is a term. Show that (t t is a term is context-free. 5. A formula in the first-order language of arithmetic is defined inductively as follows: .if t1 and t2 are terms, then t t2 is a formula, . if ty and t are terms, then t