
How can I solve this problem?
please help me ..
25. Suppose we minimize the average time to store n files of lengths l1, /2, …, /n on a tape. If the probability of requesting file k is given by pk, the expected access time to load these n files in the order ki, k2, , kn is given by the formula TaverageC The constant C represents parameters such as the speed of the
PayPal Gateway not configured
PayPal Gateway not configured