Figure 3.28 lists some well-known programming languages, with some characteristics. Using these characteristics, define a predicate that’s true for each of the following lists of languages, and false...

Figure 3.28 lists some well-known programming languages, with some characteristics. Using these characteristics, define a predicate that’s true for each of the following lists of languages, and false for every other language in the table. For example, the predicate P(x) = “x has strong typing and x is not functional” makes P(Pascal) and P(Java) true, and makes P(x) false for every x ∈ {C, C++, LATEX, ML, Perl, Scheme}.

1. Java

2. ML, Perl

3. Pascal, Scheme, Perl

4.LATEX, Java, C++, Perl

5. C, Pascal, ML, C++, LATEX, Scheme, Perl