3 Language of Tuples Is Context-Free? In the Language of Tuples Is Regular? Problem, you proved that the TUPS language is not a regular language. Now prove that TUPS is a context-free language (CFL). Your proof must be in the form of a Statements and Justifications table, but it must use the CFG representation of CFLs..