just do number 2

2. We want to count the number of occurrences of a certain event, over a period of time. Each time the event occurs we press any non-control or non-function key on the keyboard, except the letter x. When the time period has elapsed, we will press the letter x, and set the total number of events that occurred. a) Write the recursive algorithm for problem given above. b) Construct a trace table for your recursive algorithm, when the number of events = 10 c) Write the code for your recursive algorithm, using either C++ or Java. d) Write the iterative algorithm for the problem given above. e) Construct a trace table for your iterative algorithm, when the number of events = 10 1) Write the code for your iterative algorithm, using either C++ or Java. 3. Euclid's algorithm for the greatest common divisor (GCD) is given as: GCD (x, y)- GCD (y, x mod y) y=0 xy,x0 x+0} a) Write the recursive algorithm for GCD given above. b) Construct a trace table for your recursive algorithm, when x = 27 and y=3. c) Write the code for your recursive algorithm, using either Chor Java