An i/o operation of b bytes takes 3b+5 μs. program s’ is like s but must also do k bytes of i/o, though the i/o may be split into any number of transfers (e. g.,k transfers of 1 byte each, k/2 transfers of 2 bytes each, . ., 1 k-byte transfer). the system designers would prefer to do multiple small transfers to avoid hogging the i/o bus. there is also a requirement that s’ takes at most 3 times as long to run as s. how best do you split the i/o while keeping system designers happy? you may assume that k is large enough to avoid using floor and ceiling functions (as an approximation), and ranges over values for which your result makes sense.