option (C ) is correct.
Because the nos of combinations with n nos boolean variable is 2^n.
Again for each such combination there will n value (as compared to 0,1 as binary values).
hENCE the possible boolean function is n*n*n*n*n-------upto 2^n times=n^2^n which is the option (C).