An iterative DFS traversal algorithm uses a(n) ______.

The function ____ can check whether an expression meets the required conditions; if the conditions are not met, it terminates the program.

A. check B. look C. assert D. what

Given the template function linSearch:

``` T, const int, T []); and the declarations: int a, b; int c[10]; the call: x = linSearch (a, b, c); would cause the automatic generation of the prototype: a.int linSearch (int, int, int[]); b. int linSearch (a, b, c); c. int linSearch (a, b, c[]); d. int linSearch (T, int, T[]); e. int linSearch (T a , int b , T c[]); ```