Suppose instead that we were working with a formal language consisting entirely of atomic propositions (symbolized by capital letters), a one-place functor *, and a three-place functor #, both of which prefix (or are written in front of) the requisite string of wffs. Write out rules, analogous to (i)- (iv) in section 6. above, for a fully-recursive syntax of this language.