Pls answer both and provide explanation as well. Previous chegg answers were incorrect.

10. What is the worst-case time complexity of finding an element in a sorted std::list if you are limited to (1) additional memory? A. (log(n)) B. (n)) C. (nlog(n)) D. (n2) E. (2n) 11. What is the worst-case time complexity of finding an element in a sorted std::list if the restriction of (1) additional memory is removed