Assume you are given a binary tree structure as below. Develop an algorithm that transforms the structure on the left into a structure on the right. On the given figure, Gr, Par and Ch stands for the Grandparent, Parent and Child nodes. Translate your algorithm into C code. Gr Gr Ch R P Par 0 0 (b) (a)