<SYSTEM_TASK:>
Solve the following problem using Python, implementing the functions described below, one line at a time
<END_TASK>
<USER_TASK:>
Description:
 def do_child_count(self, params):
 """ \x1b[1mNAME\x1b[0m child_count - Prints the child count for paths \x1b[1mSYNOPSIS\x1b[0m child_count [path] [depth] \x1b[1mOPTIONS\x1b[0m * path: the path (default: cwd) * max_depth: max recursion limit (0 is no limit) (default: 1) \x1b[1mEXAMPLES\x1b[0m > child-count / /zookeeper: 2 /foo: 0 /bar: 3 """

        for child, level in self._zk.tree(params.path, params.depth, full_path=True):
            self.show_output("%s: %d", child, self._zk.child_count(child))