Chapter 3 Structures That Control Flow In Exercises 17 and 18, write a program corresponding to the flowchart. 17. Greatest Common Divisor The flowchart in Fig. 3.29 finds the greatest common divisor (GCD) of two nonzero integers input by the user. Note: The GCD of two numbers is the largest integer that divides both. See Fig. 3.27. Enter value of M:30 Enter value of N : 35 Greatest common divisor: 5 Prime factors are 5767 FIGURE 3.27 Possible outcome of Exercise 17. FIGURE 3.28 Possible outcome of Exercise 18. Chapter 3 Structures That Control Flow In Exercises 17 and 18, write a program corresponding to the flowchart. 17. Greatest Common Divisor The flowchart in Fig. 3.29 finds the greatest common divisor (GCD) of two nonzero integers input by the user. Note: The GCD of two numbers is the largest integer that divides both. See Fig. 3.27. Enter value of M:30 Enter value of N : 35 Greatest common divisor: 5 Prime factors are 5767 FIGURE 3.27 Possible outcome of Exercise 17. FIGURE 3.28 Possible outcome of Exercise 18