************************Result****************************************
************************Series Output*********************************

Upper Bound of insertD(A,B) is nat(B)+1.                                       
Upper Bound of insertionsortD(A) is 1*nat(A)*nat(A)/2+5*nat(A)/2+1.          


************************RAML Output***********************************

The number of ticks consumed by insertD is at most:                        
          n + 1.0                                                          
where                                                                      
   n is the length of the second component of the input 

The number of ticks consumed by insertionsortD is at most:              
          0.5*n^2 + 1.5*n + 1.0                                            
where	    	     						   
   n is the length of the input