USE PROLOG Write a file name ‘bstStuff. pl’

For all of the below, we’ll represent a Binary Search Tree in prolog the following way:

bst(L, V, R)

where:

we presume ‘V’ is a number

‘L’ is a ‘bst’ holding elements strictly less than ‘V’, or is empty

‘R’ is a ‘bst’ holding elements greater than or equal to ‘V’, or is empty

‘nil’ represents an empty node****************/