Hey guys, I think for 2nd option algo is applied like this, please correct if I am wrong,
6,6,6,6,3,3,2,2 → 5,5,5,2,2,1,1 → 4,4,1,1,0,0 → 3,0,0,0,0. [Wrong way]
I got my mistake here. so just updating. I didn't followed algo correctly.
di'=di for i = 1 to n-dn-1
di'=di'-1 for i= n-dn to n-1, where n-> no. of vertices and,
dn -> max degree among degree sequence