data structures using sl sr sr sl figure insertion in case the code to handle case is as followsvoid del_case (struct node *nstruct node *ss sibling( ) - - - ( -left -colour =black&( -right -colour =black) -colour redn -parent -colour blackelse del_case ( )sl sl sr sr figure insertion in case =black&case is the left child of and is blacks' left child is reds' right child is black in this caseperform right rotation at after the rotations' left child becomes ' parent and ' new sibling alsointerchange the colours of and its new parent note that now all paths still have equal number of black nodesbut has black sibling whose right child is redso we fall into case refer fig the code to handle case is given as followsvoid del_case (struct node *nstruct node *ss sibling( )if ( -colour =black/the following code forces the red to be on the left of the left of the parentor right of the rightto be correctly operated in case *if (( = -parent -left&( -right -colour =black&( -left -colour =red)rotate_right( )else if (( = -parent -right&( -left -colour =black&( -right -colour =red)rotate_left( )