Consider the following code and tree

What will be the output of the function if it has as input the tree of the figure?

a) ( 15 ( 25 ( 20 )( 31 )) ( 8 ( 12 )) )

b) ( 15 ( 8 ( 12 ))( 25 ( 20 )( 31 )))

{ typedef struct tree int info; struct tree *left, *right } tree i i void function( tree *a) { if (a) { printf("( %d ", a->info); function (a -> left); function (a -> right) printf(""); } } ; 15 8 25 12 31 20