Any help is appreciated , I am working on a practice review for my class.

16. True False Functional programming is characterized by Cambridge pre-fix notation. 17. True False In Logical programming the program declares the goals of the computation, the method for achieving them. not 18. True False in pure Functional programming there is no notion of state and therefore no need for an assignment statement. 19. 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 achieve 20. True False An abstract class is one that is a method that contains no code beyond its signature. 21. True False The stack is generally considered to a very efficient way of storing local variables. be a 22. True False Functions must be declared before they are used in Prolog. 23, True/False Functional programming is interpreted. usually 24. True False A Prolog search space may have a vast of solutions, number 25. True False Using the heap for the memory allocation of local variables is more (i e. faster) than using the stack. efficient 26. True, False t is possible to redefine a build in function in Scheme (e.g. OR). 27. True False Prolog relations can defined recursively. be 28, True False The order of the rules in a Prolog program is a factor in determining the solutions found. 29. True False Scheme. 30. True False The LET expression in Scheme uses dynamic scope, since it is evaluated at runtime, rminina tha enlutions found