(b) (6 points) Use foldst to write a program, paths::STree Int -> [[int]], to find the list of all the paths of a search tree of integers. Thus, for example: paths (Sn (Sn Tp 5 Tp) 6 (Sn (Sn Tp 3 Tp) i (Sn Tp 2 Tp)) = [[6,5], [6,1,3], [6,1,2]] (b) (6 points) Use foldst to write a program, paths::STree Int -> [[int]], to find the list of all the paths of a search tree of integers. Thus, for example: paths (Sn (Sn Tp 5 Tp) 6 (Sn (Sn Tp 3 Tp) i (Sn Tp 2 Tp)) = [[6,5], [6,1,3], [6,1,2]]