Write a function $($using pure recursion$)$ which accepts a function, say f$,$ as the first argument and a simple list of integers as the second argument. It then applies function f on every integer of the list and returns the sum of the applications. For example,

LISP$>($f$2$ #$\text{'}($lambda $($y$)(*$ y y$))\text{'}(123))$

$14$

LISP$>($f$2$ #$\text{'}($lambda $($y$)(*$ y $2))\text{'}(123))$

$12$