What is the output of the following C code?

Bitshifting 1 to the left by n is equivalent to?

Consider a complete graph G with 5 vertices. The graph G has ____ spanning trees.

The data structure used to check whether an expression contains balanced parentheses is:

What is the time complexity of the enqueue and dequeue operations in a queue data structure?

The given pseudocode describes the steps of which search algorithm?

What is the Kirkpatrick-Seidel algorithm called?

What is the worst-case time complexity of the Knuth-Morris-Pratt (KMP) algorithm for pattern searching (m = length of text, n = length of pattern)?

Which problems can be solved using Dynamic Programming?

What will be the output of the following C program?

void count(int n)
{
static int d = 1;
printf("%d ", n);
printf("%d ", d);
d++;
if(n > 1) count(n-1);
printf("%d ", d);
}
int main()
{
count(3);
}