## Discussion Forum

Que. | Let f be a function from a set A to a set B, g a function from B to C, and h a function from A to C, such that h(a) = g(f(a)) for all a ∈ A. Which of the following statements is always true for all such functions f and g? |

a. | g is onto => h is onto |

b. | h is onto => f is onto |

c. | h is onto => g is onto |

d. | h is onto => f and g are onto |

Answer:h is onto => g is onto |