You are given a binary tree as shown below. Design an algorithm to find the nearest node with value $0$ from the root and return its distance. If there are no zero nodes, return $-1.$

a$.$ Write a pseudocode of your algorithm.

b$.$ Write the recurrence relation that defines the complexity T$($n$)$ of your algorithm.

c$.$ Solve the recurrence relation to find the complexity of your algorithm.