Implementation of Trees A I A B C D E F H I H I J K K I Arrows that point downward are FirstChild pointers. Arrows that go left to right are NextSib/ing pointers. Node Ehas both a pointer to a sibling (A)and a pointer to a child (while some nodes have neither.Implementation of Trees A B C D E F G H I J K L A B C D E F G H I J K L ◼Arrows that point downward are FirstChild pointers. ◼Arrows that go left to right are NextSibling pointers. ◼Node E has both a pointer to a sibling (F) and a pointer to a child (I), while some nodes have neither