The binary tree corresponding to the left child$-$right child representation that follows. $(1$ is the root.$)$

$\backslash$table$[[$Lichild$,$Highi child$],[,2,3],[2,4,0],[3,5,0],[4,6,7],[5,0,0],[6,0,0],[7,0,0]]$

Select one:

b$.$ NOTA

c$.$

d$.$ It $c$ an be represented by both trees