The usual $$\Theta ({n^2})$$ implementation of Insertion Sort to sort an array uses linear search to identify the position where an element is to be inserted into the already sorted part of the array. If, instead, we use binary search to identify the position, the worst case running time will

In a heap with n elements with the smallest element at the root, the 7^th smallest element can be found in time

Assume that the SLR parser for a grammar G has n₁ states and the LALR parser for G has n₂ states. The relationship between n₁ and n₂ is

Consider the grammar shown below.

$$\eqalign{ & S \to CC \cr & C \to cC\,|\,d \cr} $$

This grammar is