This Question is for my Data Structure and Algorithms class, Please help and thank you!

1. In a heap, the heights of the left and right subtrees of a node differ by atmost 1.

2. The best case running time of Bubble Sort is O(n).

3. The best case running time of Merge Sort is O(n).

4. The worst case complexity of Quick Sort is O(n2).

5. The worst case complexity of AVL Tree insertion is O(n)