On a piece of paper, draw the binary search tree obtained when inserting the values 14, 4, 5, 13 15, 11, 6, 2, 9, 3, 8, 10, 12, 7, 19 in that order. In which order are the elements of the obtained binary search tree accessed during a BFS, Preorder DFS, Inorder DFS and Postorder DFS traversal? Remember to enter your answers separating nodes by commas, no spaces (i.e. 1,2,3,4,5) BFS: Preorder DFS: norder DFS: Postorder DFS