i is true, since in worst case the graph can be complete. So, d+1 colours are necessary for graph containing vertices with degree atmost 'd' .
ii is false since cyles with odd no of vertices require 3 colours.
iii is true, since each level of the tree must be coloured in an alternate fashion. We can do this with two colours.
Therefore, option c is correct.