Write a function that performs ONE PARTITION for an array of integers, as defined by the quicksort algorithm. The function has three parameters: an array of integers, the index of the leftmost element to be partitioned, and the index of the rightmost element to be partitioned. (See the quicksort notes for more explanation.) The return value is the index where the pivot element is placed after the partition. When the function returns, all elements to the left of that location (within the partitioned portion of the array) must be less than or equal to the pivot, and all elements to the right of that location (within the partitioned portion of the array) must be greater than or equal to the pivot. int partition (int all, int left, int right); This function does not sort the array, it only partitions.

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)