Assertion: Binary search tree property allow to print all keys in binary search tree in sorted order by simple recursive algorithm called inorder tree walk.

Reason: The inorder tree walk algorithm print the key root of subtree between printing value in its left subtree and printing those in its right subtree.

Options:

(a) Assertion is true, Reason is true, and Reason is the correct explanation of the Assertion.

(b) Assertion is true, Reason is true, but Reason is not the correct explanation of the Assertion.

(c) Assertion is true, but Reason is false.

(d) Assertion is false, but Reason is true.