For this program, consider the following pseudocode algorithm for checking if a particular positive integer satises the collatz conjecture: algorithm 1 collatz conjecture checker. t e rmi n a ti o n ( n ) { // pre−c o n di ti o n : n i s any i n t e g e r w hil e n not e q u al 1 do { i f even ( n ) then n : = n/2 e l s e n : = 3n+1 } output ( n ) // post−c o n di ti o n : n=1 } • write a c program to implement the algorithm as a function called termination that is called from main. [4 points] • call termination from main on an input integer given by the user. [2 points] • count and display how many iterations are executed for the input. [2 points]