Suppose we want to replicate a file over a collection of n servers, labeled S, S, ..., S...To place a cop of the file at server results in a placement cost of i, for an integer Ci > 0. Now, if a user requests the file from server >i, and no copy of the file is present at >i, then the servers Si-, Si-, Si-.... are searched in order until a copy of the file is finally found, say at server S; where j > i. This results in an access cost ofJ-1(Note that the lower-indexed servers Si-, Si-2, are not consulted in this search.) The access cost is 0 if >i holds a copy of the file. We will require that a copy of the file be placed at server S,, so that all such searches will terminate, at the latest, at S, We'd like to place copies of the files at the servers so as to minimize the sum of placement and access costs. Formally, we say that a configuration is a choice, for each server si with i = 1,2, ,n-1, of whether to place a copy of the file at Si or not. (Recall that a copy is always placed at S.) The total cost of a configuration is the sum of all placement costs for servers with a copy of the file, plus the sum of all access costs associated with all n servers Give a polynomial -time algorithm to find a configuration of the minimum total cost. What is the running time of your algorithm