Given any Binary Tree and any integer k, what does the algorithm "CountPaths" do?
A) Counts the number of paths from root to leaf that sum to k.
B) Counts the number of paths from root to leaf with exactly k nodes.
C) Counts the number of paths from any node to its children that sum to k.
D) Counts the number of paths from any node to its children with exactly k nodes.