perators like && and $||$ return strictly $0$ or $1$ values.

Given two functions f$1()$ and f$2()$ which return a value of the same type, how would you implement the C equivalent of Scheme's $($or $($f$1)($f$2)).$ Can you package up your abstraction as a function? $15-$points

A Java function takes a list of employees and returns a new list containing those employees having a particular gender:

ListEmployee select$\_$gender$($ListEmployee employees, Gender gender$)\{$ if $($is$\_$empty$\_$list$($employees$))\{$ return new ListEmployee$()$; $\}$ else $\{$ Employee head $=$ head$\_$list$($employees$)$; ListEmployee tail $=$ tail$\_$list$($employees$)$; ListEmployee selectGenderRest $=$ select$\_$gender$($tail$,$ gender$)$; return $($head$.$gender $==$ gender$)?$ cons$\_$list$($head$,$ selectGenderRest$)$ : selectGenderRest; $\}\}$

Why is the above function not tail$-$recursive? $5-$points

Rewrite it to be tail$-$recursive. It must be recursive and use the same original auxiliary functions. $10-$points