Answer this in Haskell please!

Multisets, or bags, can be represented as list of pairs (x,n) where n indicates the number of occurrences of x in the multiset. typeBaga=[(a,Int)] For the following exercises you can assume the following properties of the bag representation. But note: Your function definitions have to maintain these properties for any multiset they produce! (1) Each element x occurs in at most one pair in the list. (2) Each element that occurs in a pair has a positive counter. As an example consider the multiset {2,3,3,5,7,7,7,8}, which has the following representation (among others). [(5,1),(7,3),(2,1),(3,2),(8,1)] Note that the order of elements is not fixed. In particular, we cannot assume that the elements are sorted. Thus, the above list representation is just one example of several possible. d) Define a function subbag that determines whether or not its first argument bag is contained in the second. subbag::EqaBagaBagaBool Note that a bag b is contained in a bag b if every element that occurs n times in b occurs also at least n times in b