Data structures, Tries, c++

Problem 1. Complete the following function that returns the number of strings in a trie rooted at root. int count (Node* root) if (root nullptr) return __; int tot0; for (int i 0; i children[i]) if (root->end) tot . return . Problem 2. Complete the following function that returns the number of strings of length-l in the trie rooted at root. int count (int 1, Node*root) if (root nuuptr) return return ; int tot0 if (root-end && -- 1; for (int i = 0; children[i]); return tot