I think of option (D) none of the options is correct.
For shortest time first, process with high burst time will starve.
While for first come first serve, if the very first process has very large burst time say 1000 while other arriving process have very low burst time say 1. then they have to wait for very long time for first process to be completed and therefore starve. Therefore none of the above two can avoid starvation
Edit : Thanks @Kshitij_Kumre for pointing out my mistake.
So the point that is need to be understood here is the definition of starvation, starvation means “INDEFINITE waiting” means "we don't know how much time we should wait". In algorithm like SJF, the waiting time for processes with large burst time cannot be determined as several processes with low burst time may keep coming and therefore it is indefinite. This waiting time can be very long and is indefinite, therefore starvation.
But for FCFS although the waiting time can be very large if the first or early process have large burst time [The phenomenon is also known as convoy effect], but still it is not indefinite because we can always calculate it for any given process as the sum of burst time of all the process before it and therefore cannot be considered as starvation.
So the correct answer is Option (C) (ii) only.