Given a Binary Search Tree $($BST$),$ which of the following statements are true about its height? $($Choose all

that apply$)$

The height of a BST with $n$ nodes is always $(logn).$

The height of a BST with $n$ nodes can be $(n)$ in the worst case.

The height of a perfectly balanced BST with $n$ nodes is $(logn).$

The height of a BST is the number of edges on the longest path from the root to a leaf.

The height of a BST is the number of nodes on the longest path from the root to a leaf.