The function travel() receives root of a Binary Search Tree (BST) and a positive integer k as arguments. What is the code segment prints // A BST node struct node { int data; struct node *left, *right; }; int count = void travel (struct node *root, int k) { } 0; if (root != NULL && count <= k) { } travel (root->right, k); count++; if (count = k) printf("%d", root->data); travel (root->left, k); O Prints the kth largest element in BST Prints the rightmost node at level k from root O Prints the kth smallest element in BST O Prints the leftmost node at level k from root