The goal of this testing assignment is for you to perform structural, white-box testing on a software program that calculates the Greatest Common Divisor of a pair of integers. The program accepts integer inputs (X, Y) and outputs GCD (Z).   Refer to the pseudocode Euclid’s algorithm of the program on the next page. This assignment requires the following tasks:1) Analysis – Analyze the program, number the statements in it as shown in the algorithm and generate a program graph. After a thorough analysis of the graph, discuss how many paths in the program should be tested and illustrate three typical paths through the program. 2) Decision-to-Decision Path Testing – Generate a DD-Path graph of the given program by referring to the program graph generated in the previous step. Refer to the DD-Path graph and pick a set of DD-Paths that based on your analysis when tested will achieve complete test coverage C1 of the program. Generate and execute test cases based on these DD-Paths. Present the analysis that led to the selection of the tested paths and Structural Test Case Form for each test case run.