a) Show that the type of a function composition is equivalent to the hypothetical syllogism rule of proposi tional logic b) Consider the following functions: int g(String s) [ double f(int x, int y) l (Although the functions are written in Java-style, this is an arbitrary functional language.) Let function h be defined as Use only Curry-ing, "hypothetical syllogism" and "implication introduction" to prove that h has type h(s1, s2)-f (g (s1), g(s2)) StringString double. a) Show that the type of a function composition is equivalent to the hypothetical syllogism rule of proposi tional logic b) Consider the following functions: int g(String s) [ double f(int x, int y) l (Although the functions are written in Java-style, this is an arbitrary functional language.) Let function h be defined as Use only Curry-ing, "hypothetical syllogism" and "implication introduction" to prove that h has type h(s1, s2)-f (g (s1), g(s2)) StringString double