What is the time complexity of the function fun()?

A connected planar graph with 6 vertices and 7 edges contains how many regions?

Depth First Search is equivalent to which type of traversal in Binary Trees?

Network connectivity is an application of which algorithm?

What are the two factors for measuring the efficiency of an algorithm?

In the worst case, the number of comparisons needed to search for a given element in a singly linked list of length n is

Which of the following options correctly describes the features of an insertion sort algorithm?

What are the various algorithms used to find the Minimum Spanning Tree of a graph?

What will be the output of the following code?

int c = 0;
void my_function(int n)
{
if (n == 0)
return;
c++;
my_function(n / 10);
}
int main()
{
my_function(64535768);
printf("%d", c);
return 0;
}

Consider the problem of reversing a singly linked list. To take an example, given the linked list below :

the reversed linked list should look like

Which one of the following statements is TRUE about the time complexity of algorithms that solve the above problem in O(1) space?