Please help, trying to complete this by tonight to help me study for my exam, but I am stuck after trying many times.

16. True/False Scheme is good at symbolic data processing, mathematical logic, game play and other fields of artificial intelligence. 17. True /False Cambridge prefix notation is used for all Scheme expressions 18. True /False In Logic programming the program declares the goals of the computation, not the method for achieving them. 19. True False InFunctional programming there is no notion of state and therefore no need for an assignment statement. 20. True /False In Functional programming there is no way to increment or decrement the value of a variable so the effect of a loop can only be achieved via recursion. 21. True False With polymorphism the same call could evokes a different method depending on the type of the reference. 22. True False An abstract class is one that is a method that contains no code beyond its signature. 23. True False In OO an interface encapsulates collection of constants, abstract method signatures and may include variables, constructors, or non-abstract methods 24. True /False Reference semantics: Expression is evaluated to a value, which is copied to the target used by object-oriented languages. 25. True False Copy semantics: Expression is evaluated to an object, whose pointer is copied to the target, used by imperative languages 26. True False Encapsulation is a mechanism which allows logically related constants, types, variables, methods, each to be its own separate entities 27. True/False The order of the rules in a Prolog program is a factor in determining the number of solutions in the search space. 28 Declarative programming emphasizes "why not" over "why" B. "what" over "how" C. "what" over here D. "how" over "what's A. 29 object oriented programming emphasizes A. "why not then "why" B. "what then "how" C. "what" then "where D. "how" then what's 30. The quintessential programming language in the logic programming paradigm is C. Godel; A. Scheme B. Haskell D., Prolog, E. C F. Java 31. The following programming languages are Turing complete D. Prolog A. Java B. C C. Scheme E. all F. none