In class we discussed how functions can be used to do modular programming Rather than write a program that consists of only the main function, we can disaggregate the overall task of a program into more manageable subtasks. The maintenance, implementation and design of a program becomes easier We can then write functions to solve the subtasks making up the program. In this project, you will write a menu-driven application that performs various tasks involving elementary numerical algorithms. Subtasks in the program will be carried out by functions. For now, all the functions will be defined in the same file, NumericalAlgorithmsDemo.cpp, as the main function. We discuss the functions and the associated algorithms below: The Text-Based Menu Interface Displays the text-based mena interface for she progran . [11 Grestest Conzon Divisor and Least Common Factors .[21 Grestess Prize Factor [3] Relative Prise Test [4 Prine Test to] quit void zenu) Greatest Common Divisor and Least Common Multiple Definition 1. The greatest common divisor, sometimes also called the highest common divisor, of two positive integers a and b is the largest divisor common to a and b. For example, GCD(3,5)-1, GCD 12,60) 12, and GCD (12,90) 6. In class we discussed how functions can be used to do modular programming Rather than write a program that consists of only the main function, we can disaggregate the overall task of a program into more manageable subtasks. The maintenance, implementation and design of a program becomes easier We can then write functions to solve the subtasks making up the program. In this project, you will write a menu-driven application that performs various tasks involving elementary numerical algorithms. Subtasks in the program will be carried out by functions. For now, all the functions will be defined in the same file, NumericalAlgorithmsDemo.cpp, as the main function. We discuss the functions and the associated algorithms below: The Text-Based Menu Interface Displays the text-based mena interface for she progran . [11 Grestest Conzon Divisor and Least Common Factors .[21 Grestess Prize Factor [3] Relative Prise Test [4 Prine Test to] quit void zenu) Greatest Common Divisor and Least Common Multiple Definition 1. The greatest common divisor, sometimes also called the highest common divisor, of two positive integers a and b is the largest divisor common to a and b. For example, GCD(3,5)-1, GCD 12,60) 12, and GCD (12,90) 6