Algorithms and Data Structures

The question was originally German. I translated most of it. The rest is easily understandable. If you have any problem please use a translation app. Or mention it as comment.

In the following, we now consider relations between classes. For each question, indicate whether class A is contained in B (but not equal), whether B is contained in A (but not equal), whether the classes are equal (A=B), or whether none of them is true. 5.9 Sei A = O(n) und B = O(n). Wie stehen A und B zueinander? O A= B A is a subset of B B is a subset of A none of the answers 5.10 Sei A = 0(2") und B = O(3"). Wie stehen A und B zueinander? O A=B A is a subset of B O Bis a subset of A none of the answers O A=B 5.11 Sei A = O(n log n) und B = O(n). Wie stehen A und B zueinander? O A is a subset of B B is a subset of A none of the answers O A=B 5.12 Sei A = O(4n2) und B = O(n*(3n-2)). Wie stehen A und B zueinander? A is a subset of B B is a subset of A none of the answers 5.13 Sei A = O(n log n) und B = (log(n!)). Wie stehen A und B zueinander? A is a subset of B OB is a subset of A O A=B none of the answers 5.14 Sei A = Q(n) und B = (n). Wie stehen A und B zueinander? O A is a subset of B B is a subset of A O A = B none of the answers