(Grading details: correct answer=8, empty=0, wrong answer=-3) Suppose that the sharp lower bound for the worst-case complexity of a problem is 2(n), but this is not known. And the only known algorithm for this problem has worst-case complexity (n"). The following persons claim that they have proved new lower bounds and developed new algorithms for this problem as follows: a) Person A : I proved a worst-case lower bound (logn) and I developed an algorithm with W(n) O(nlogn). b) Person B : 1 proved a worst-case lower bound (n2.7) and I developed an algorithm with W(n) E O(na). C) Person C:1 proved a worst-case lower bound (nlogn) and I developed an algorithm with W(n) E O(n27logn). d) Person D:1 proved a worst-case lower bound 12(123) and I developed an algorithm with W(n) E O(n3.5). Which one/ones of these claims can be true? (The claims of a person are true if both of his/her claims are true.) Select one: Only (b) and (c) ob. Only (a) Only (a) and (c) O d. Only (d)