Consider the matroid M with ground set ={0,1,…,13}and independent sets {{0, , }∣ , ∈[13], < } and all possiblesubsets (you can think of these 3-element subsets as differentbases). Suppose that i has weight i except for 12, which hasweight 1. What is the maximal 3 element set in M obtained by thegreedy algorithm?
What is the final set you obtained:
Did it find the independent 3-element set in M ofmaximal weight?
A. True
B. False
Expert Answer
An answer will be send to you shortly. . . . .