I am only given one hour to code this. [NOTE : NO arrays, pointers, recursion and strings should be used in this code.] 1) How do I go about doing this is under an hour? Please include some thought processes. 2) What's the best way to savage the maximum amount of marks if I don't complete this in under an hour?

Exercise 1: Collatz's Problem[50 marks] Problem Statement Following is the control flow graph describing the computation of Collatz's sequence. False True True False n is even printn Given an integer value n, a program with the above control-flow graph prints out the current value ot at every iteration, until control reaches the exit point. Both the division and multiplication operate on integer value Write a program collatz.c that reads in two positive integers, and count, where n is the input to the Collatr's seqence, and count is the maximum number of iterations (and thus the maximum number of times the value of n is printed) required far execution The prograshold call a function displayCollotzinrernal which does the fallowing: .Compute Collatz's sequence by printing out the values of at each iteration, for up to cvunt number of iterations Print out the number of times the division statement "n=n2" and the multiplication statement "n = n 3 + 1" have been executed. You are to decide the appropriate parameters), return type and precondition f anyl for this function. You may define additional functions as needed You may assume that the inputs are valid .e., positive integers)