te a C program that implements the "3A+1 algorithm. This algorithm odd or even. If it is odd, it computes 3 ti being assigned back to the variable that contained the original number works like so: starting with a given integer number, the algorithm determines whether the number is mes the original number plus one, as the name 3A+1 suggests. If the number is even, it is divided by 2. In either case, the result is The process keeps going until a result of 1 is achieved, at which point the algorithm t nobody could ever prove that it actually terminates. For our purposes we just assume it does! Here is a sample run of the algorithm for an initial number of 7 7-> 22-> 11-> 34-> 17-> 52-> 26-> 13-> 40-> 20-> 10-> 5-> 16 834-2-> 1 As you can see, the algorithm ran though 16 iterations until it reached 1. In your implementation of the algorithm I want you to run it on all natural numbers, starting at 1, up to and including some value MAX. I ask you to implement MAX as a symbolic constant using a Ndefine preprocessor directive. For each run, you are supposed to print out the original number and how many iterations it took to eventually reach 1