(i) If A is recursive then complement of A is also recursive
Recursive languages are closed under intersection. So, this is TRUE.
(ii) If A and B are recursive sets then A intersection B is not always is recursive set.
Recursive languages (or sets) are closed under intersection. So the intersection of two recursive languages will always be a recursive language. So, this is FALSE.
(iii) Every recursive set is recursive enumerable and vice-versa
Recursive set is a proper subset of recursively enumerable set. So, every recursive set is also recursively enumerable. But reverse is not true, i.e. there are sets which are recursively enumerable but not recursive. Proof of this can be found in any standard TOC textbook(like Peter Linz). So, this statement is FALSE.
Option (C) - TFF