Evaluate below claims of the problems and their algorithms in terms of possibility, importance and order-optimality.
Problem A has worst-case lower bound $\Omega(n^{2})$ and there is an algorithm with $W(n) \in \mathcal{O}(n)$.
Problem B has sharp worst-case lower bound $\Omega(n^{2})$ and there is an algorithm with $W(n) \in \mathcal{O}(n)$.