$($B$)$ Write a pseudocode to find the middle element of a singly linked list. $(2$ marks$)q,$

$q,$

$q,$

$q,$

$q,$

$($C$)$ Draw a Binary Search Tree $($BST$)$ whose elements are inserted in the following order, starting from $30$ :

$30,17,20,10,8,15,25,23,39,35,42$

$(2$ mark$)$