$?$

12 Choose the one that correctly performs a left rotation on an AVL tree: out of O A. uestion O B. Node y = x.left; Node y2 = y.right; y.right = x; x.left = y2; y.what max (a: some fun (N: y.left), b: some fun (N: y. right)) + 1; x.what = max(a: some fun (N: x.left), b: some fun (N: x.right)) + 1; return y; Node y = x.left; Node y2 = y.right; y.right = x; x.left = y2; y.what = max(a: some fun (N: y.left), b: some fun (N: y.right)) + 1; x.what = max (a: some fun (N: x.left), b: some fun (N: x. right)) + 1; return x; OC. Node y = x.right; O D. Node y2 = y.left; y.left = x; x.right = y2; x.what = max (a: some fun (N: x.left), y.what = max(a: some fun (N: y.left), return y; Node y = x.right; Node y2 = y.left; y.left = x; x.right y2; x.what = max (a: some fun (N: x.right) + 1); some fun (N: y.right) + 1); some fun (N: x.left), b: some fun (N: x.right)) + 1; y.what = max (a: some fun (N: y.left), b: some fun (N: y.right)) + 1; return y;