Total Recursive Functions are similar to:
Total Recursive Functions are functions that are defined for every integer of the set f(i1,i2,....,in). For example, all arithmetic functions like multiplication,n! etc are total recursive functions. Such functions are similar to the class of Recursive languages as they are computable by Turing Machines that always halt.
So, option (a) is the correct response to the question.