An element in an array X is called a leader if it is greater than all elements to the right of it in X. The best algorithm to find all leaders in an array

A | Solves it in linear time using a left to right pass of the array |

B | Solves it in linear time using a right to left pass of the array |

C | Solves it using divide and conquer in time (nlogn) |

D | Solves it in time 8n |