Question 1 [10]. Write a struct 'House that has two member variables: (string) first name of the owner, (int) house number. Implement the binary search tree whose each node has data component an instance of the struct House. Comparison of the nodes must be made with respect to first name. Write the following functions to: (i) insert nodes in a tree; (ii) print the tree in post order fashion; (iii) find the minimum element of the tree; (iv) remove a node from the tree; Implement the following: (i) insert five elements to the tree: (Kabeer, 25), (John, 65) and (Paul, 43), (Kaur, 93), (Patel, 37) (you must hardcode these elements); print the tree post order fashion; remove an element from the tree (Paul, 43) (you must hardcode this elements); (iv) find the minimum element of the tree; print the tree in post order fashion; (iii)