Suppose I have a complete binary tree that contains $7$ nodes. Which of the following are true?

This tree is full

There are four leaves

The height of the tree depends on the structure of the $7$ node complete tree

The height of the tree is $2$

The tree is a heap

$6$

Multiple Choice $2$ points

Which of the following lists would give a worst case big O when sorting with quicksort?

$123456789$

$826453719$

$563892174$

$192837465$