1. Compute the maximum number of possible execution paths for Euclid's algorithm given in as a function of the maximum number of input values. 2. Consider the following sorting program fragment: Select a number of “significant” execution paths, and find values of array a that cause their traversal. 3. In. addition' o the usual logical operators for composing Boolean expressions, Ada allows operators or – 1 a. and and-then. Give rules for building control flow graphs for statements that use these operators.