Exercise 5.4.1. Revise the program so that it prints out all the steps involved in the algorithm. Here is a sample output: GCF(500, 300) => GCF(300, 200) => GCF(200, 100) => GCF(100, 0) => 100 Exercise 5.4.2. For experts: Revise the gcf function so that it uses an iterative (loop- based) approach. Each cycle through the loop should stop if B is zero; ot

herwise, it

should set new values for A and B and then continue. Youll need a temporary variabletempto hold the old value of B for a couple of lines: temp = b, b = a%b, and a = temp

c++ programming language please

gcf.cpp #1 nclude #1 nclude using namespace std; int gcf(int a, int b); int mainO int a- 0, b0; // Inputs to GCF cout > a; cout > b; cout