What is wrong with the following code of insertion in fibonacci heap. Choose the correct option FIB-INSERT(H, x) degree[x]= 0 p[x]= NIL child[x] =NIL left[x] =x right[x] =x mark[x] =FALSE concatenate the root list containing x with root list H if min[H] = NIL or key[x] > key[min[H]] then min[H]= x n[H]= n[H] + 1

What is wrong with the following code of insertion in fibonacci heap.

1.	What is wrong with the following code of insertion in fibonacci heap. Choose the correct option FIB-INSERT(H, x) degree[x]= 0 p[x]= NIL child[x] =NIL left[x] =x right[x] =x mark[x] =FALSE concatenate the root list containing x with root list H if min[H] = NIL or key[x] > key[min[H]] then min[H]= x n[H]= n[H] + 1
A.	Line -11
B.	Line -3
C.	Line 9
D.	Line 7
Answer» D. Line 7