Assume a directed graph contains $4$ nodes, and each node has exactly two in$-$degree$($no loops$),$ then what is the maximum out$-$degree you would have for one node in the grapha. One out$-$degreeb. Two out$-$degreec. Three out$-$degreed. Four out$-$degree