I need help for this problem in Cryptology please, and please make it legible I often can't read handwriting.

5. Put the following complexity classes in their proper order of contain- ment. If any are equal, indicate that as well. O(1.1"), O(n3), 0(3"), O(In(n)), O(n!), O(n' + n2), O(n 100), O(n2n), O(login (n)), 0(10100)