Now we will consider different cases for analyzing the time complexity of our MakeRefExpr() algorithm.
later it is extended to take care of different refinements (like relational, boolean description etc) that could not be handled by Incremental algorithm.