$($Refer to Exercise $2$ on page $130$ of the textbook$)$ Ada must sometimes use the context of a function call to determine which overloaded definition to use. Consider the statemente :$=$ f$($f$($a$,$b$),$ f$($c$,$ d$))$ in an Ada$-$like language. Give an example of a set of types for the overloaded function f that makes this statement ambiguous, even when the types of a$,$ b$,$ c$,$ d$,$ and e are known.