Imagine we have created a Binary Search Tree $($BST$)$ by inserting the following sequence of integers into an empty BST $($in this exact order$)$:

$40,70$

Which of the following, when inserted immediately after the above sequence of integers, will result in a perfectly unbalanced tree? Select all that apply.

Note: Consider a tree containing $n$ nodes to be "perfectly unbalanced" if it has a height of $n-1$ edges.

$55$

$27$

$52$

$5$

$32$

Select all possible options that apply.