True$/$False: Place your answer on the line Provided.

T$/$F$.$ In Prolog, a function's formal parameters may serve as both "inputs" and "outputs".

$\frac{T}{F}.$ In functional programming languages like OCam$\frac{l}{F}$#$,$ a function requiring more than one parameter will accept only one parameter and yield a new function to accept the next parameter.

T$/$F$.$ While the datatype systems of Object$-$Oriented languages rely on classes and inheritance, languages in the ML family $($SML$,$ OCaml, F#$)$ rely upon Algebraic Types $($aka$,$ Discriminated Unions$)$

T$/$F$.$ Whereas classes can be used to implement "type abstraction$"$ in OO languages, high$-$order functions can be used to implement "control abstraction$"$ in functional languages.

T$/$F$.$ In languages that implement "tail$-$recursion", it is generally best to avoid recursion altogether for better performance and to avoid potential stack overflows.

T$/$F$.$ Individual programming languages may be classified as either Object$-$Oriented or Functional but never have features of both paradigms, as this would create ambiguities for compilers.

T$/$F$.$ Regardless of the language, $2-$dimensional arrays must always be represented in contiguous blocks of the computer's memory.

T$/$F$.$ It would be possible for a language to have no "for$-$loop" or "while$-$loop", relying only on Recursion and High$-$Order$-$Functions to iterate over a range of values. $($E$.$g$.,$ Stepping through all elements of an array.$)$

T$/$F$.$ If a language uses "Lazy Evaluation," it's possible that $g(x)$ may never be evaluated in an expression such as: result $=f(x,g(x)).$

T$/$F$.$ The $r-$value of an expression represents the memory location where a result will be stored.

T$/$F$.$ Functional programming languages rely heavily on immutable values to control "side effects".

T$/$F$.$ In Object$-$oriented languages such as Java, duck typing allows the compiler can verify that every variable has been properly initialized to a non$-$null value before its first use in any expressior

T$/$F$.$ Exceptions $($try$/$catch$)$ in a language like Java may be implemented with Continuations in languages with continuation support.

T$/$F$.$ Option Types may be used with pattern matching to handle situations where no valid result