Please answer clearly with all steps.

Question 2: (a) State exactly why the following recursive function is incorrect. mark) int fun( int n) return n fun(n; (b) Explain everything that is wrong with the recursive function below, which should count the number of nodes in a linked list. (1 mark) int getLength( Node* node) if ( node->next -nullptr) return 1 getLength( node->next); ) (c) State exactly why the following recursive function is incorrect. ( mark) int clz( int n) ( if ( n-# 1 ) return 0; if ( n%21-0 ) return 1 + c12( 3*n + 1 ); else return clz( n/2)