Count Keys - Algorithms Homework Description Implement a function int count_keys(tree_node_t *tree, key_t a, key_t b); that counts the keys x with a ≤ x ≤ b in the leaf nodes of the given search tree. The function should work with the given code for a height-balanced tree.