UN/ Problem 5.2(P384) Later in this chapter we will take a single function and generate many different variants that preserve the function s behavior but with different performance characteristics. For three of these variants we found that the run times(in clock cycles)can be approximated by y the following functions: Version 1 60+ 35n · Version2136+4n · Version3157+1.25n For what values of n would each version be the fastest of the three? Remember that n wil always be an integer 2021/10/29Problem 5.2 (P384) • Later in this chapter we will take a single function and generate many different variants that preserve the function’s behavior, but with different performance characteristics. For three of these variants, we found that the run times (in clock cycles) can be approximated by the following functions: • Version 1 60 + 35n • Version 2 136 + 4n • Version 3 157 + 1.25n For what values of n would each version be the fastest of the three ? Remember that n will always be an integer. 2021/10/29 3