Explanation and code. PLEASE DONT COPY FROM OTHER CHEEG ANSWERS

6. Suppose you have a multiset L of integers (a multiset is like a set, except it can contain multiple elements with the same value), where L = n. You want to determine whether the following is true: for all subsets K CL, the sum of elements in K is greater than or equal to |K|2. (Here, |K|| denotes the number of elements in K.). Design an efficient (non-brute force) algorithm to verify whether the claim is true. What is the running time of this algorithm as a function of n? 6. Suppose you have a multiset L of integers (a multiset is like a set, except it can contain multiple elements with the same value), where L = n. You want to determine whether the following is true: for all subsets K CL, the sum of elements in K is greater than or equal to |K|2. (Here, |K|| denotes the number of elements in K.). Design an efficient (non-brute force) algorithm to verify whether the claim is true. What is the running time of this algorithm as a function of n