Which of the three functions above (runtime_increment, runtime_print and runtime_pow) has time performance ‘closer’ (or more similar) to that of the runtime_rec in the code below? Note that you do not need to compute the time complexity for runtime_rec. We did not cover that yet. Use other methods (e. g. look at the actual time it takes to execute for different values of N and see to which function from above).

Given a link with a maximum transmission rate of 32.8 mbps. only two computers, x and y, wish to transmit starting at time t = 0 seconds. computer x sends filex (4 mib) and computer y sends filey (244 kib), both starting at time t = 0. statistical multiplexing is used, with details as follows packet payload size = 1000 bytes packet header size = 24 bytes (overhead) ignore processing and queueing delays assume partial packets (packets consisting of less than 1000 bytes of data) are padded so that they are the same size as full packets. assume continuous alternating-packet transmission. computer x gets the transmission medium first. at what time (t = ? ) would filey finish transmitting? give answer in milliseconds, without units, and round to one decimal places (e.g. for an answer of 0.013777 seconds you would enter "13.8" without the quotes)