<div>Hello All</div> <div> </div> <div>There are 2 questions for my project and I need to aswer them as soon as possible. The answers need to be written in Haskell using recursive methods.</div> <div> </div> <div>The questions are the following:</div> <div> </div> <div> </div> <div>Number 1:</div> <div>The set of <VAR>n</VAR>-combinations of a set <VAR>S</VAR> is the set of subsets of <VAR>S</VAR> of size <VAR>n</VAR>. Write a function <CODE>combs :: Int -> [a] -> [[a]]</CODE> which, representing sets as lists, calculates <VAR>n</VAR>-combinations of a given list. For example, <CODE>combs 3 [1,3,5,6,9]</CODE> is <CODE>[[1,3,5],[1,3,6],[1,3,9],[1,5,6],[1,5,9], [1,6,9],[3,5,6],[3,5,9],[3,6,9],[5,6,9]]</CODE> </div> <div>Within each combination, the <VAR>n</VAR> values should appear in the same order as they appear in the original list (so, for example, <CODE>[1,5,3]</CODE> should not appear instead of <CODE>[1,3,5]</CODE> in the result for
<CODE>combs 3 [1,3,5,6,9]</CODE>). But the list of combinations may appear in any order (ie, <CODE>[1,3,5]</CODE> need not appear first in the result of <CODE>combs 3 [1,3,5,6,9]</CODE>). You may assume that the list argument to <CODE>combs</CODE> does not contain duplicate members. </div> <div> </div> <div>Number 2:</div> <div>Given a list of lists, a list is in the Cartesian product of them if it contains one member from each of them. Write a function <CODE>cart :: [[a]] -> [[a]]</CODE> which calculates this. For example, <CODE>cart [[1,2], [4], [7,8,9]]</CODE> is <CODE>[[1,4,7],[1,4,8],[1,4,9],[2,4,7],[2,4,8],[2,4,9]]</CODE> </div> <div>Each member of the Cartesian product must appear in the appropriate order: eg, in <CODE>[1,4,7]</CODE> above, <CODE>1</CODE> appears first, then <CODE>4</CODE>, then <CODE>7</CODE>, because <CODE>1</CODE> is from the first input list <CODE>[1,2]</CODE>, <CODE>4</CODE> is from the second input list <CODE>[4]</CODE>, and
<CODE>7</CODE> is from the third input list <CODE>[7]</CODE>. The list of members of the Cartesian product may appear in any order (ie, <CODE>[1,4,7]</CODE> need not appear first in the list).</div> <div> </div> <div> </div> <div>It would be very much appreciated if you could help me or provide me with some code, please. I need them very soon.</div> <div> </div> <div>Thanks!</div><p> Send instant messages to your online friends http://au.messenger.yahoo.com