Example 13: Draw a flowchart to receive two positive whole numbers and compute their Greatest Common Divisor, using the following Euclidean technique. If the inputs are 64 and 12, 64-12= 52 52-12=40 40-12=28 28-12=16 16-12=4 12-4=8 8-4=0 the GCD of 64 and 12 is 4. As another example, if the inputs are 35 and 42 42-35=7 35-7=28 28-7=21 21-7=14 14-7=7 7-7=0 the GCD of 35 and 42 is 7. Example 14: Draw a flowchart to receive two positive whole numbers, a and b, and output the result of a times b. You are NOT allowed to use the multiplication (*) operator to compute the multiplication. As an example, if inputs are 5 and 23, the output should be 115