Please answer all questions. Thanks!

Questions & Exercises 1. A primitive in one context might turn out to be a composite of primitives in another. For instance, our while statement is a primitive in our pseudocode, yet it is ultimately implemented as a composite of machine- language instructions. Give two examples of this phenomenon in a non- computer setting. primitives? tive integers X and Y by the following process: 2. In what sense is the construction of procedures the construction of 3. The Euclidean algorithm finds the greatest common divisor of two posi- As long as the value of neither X nor Y is zero, continue dividing the larger of the values by the smaller and assigning X and Y the values of the divisor and remainder, respectively. (The final value of X is the greatest common divisor.) Express this algorithm in our pseudocode. 4. Describe a collection of primitives that are used in a subject other than computer programming