Consider a binary search tree (BST). Which one of the following properties is always true for an inorder traversal of the BST?

1. AIt gives the nodes in descending order of values of keys
2. BIt gives the nodes in random order of values of keys
3. CIt only visits the leftmost and rightmost nodes
4. DIt gives the nodes in ascending order of values of keys