1. 6 pts. Match each type of traversal of a BST with its corresponding algorithm that implements it Algorithm 3 traversal 1(w 1: if w NULL then 2 traversall (w.left) 3 visitw.element) 4: traversall (w.right) 5: end if Algorithm 4 traversal2(w 1: if w NULL then 2 visit(w.element) 3: traversal2(w.left) : traversal2 (w.right) 5: end if Algorithm 5 traversal3() i: if u, NULL then 2 traversal3(w.le ft) 3 versal3(w.right) visitw.element) 5: end if Preorder traversal traversal1 Inorder traversal traversal:2 Postorder traversal traversal3