consider the language L = {a^f b^g|f

Let ∑ = {a, b}. Given the language L = {b^n a^m: m,n≥0}, find the regular expression r such that L(r) = L.

The class I'm taking is computer science discrete structures. I am completely stuck. Please help! If you can please add an explanation with answer so I can better understand . Thank you!

Given a list of rational numbers,find their product. ConceptThe reduce() function applies a function of two arguments cumulatively on a list of objects in succession from left to right to reduce it to one value. Say you have a list, say [1,2,3] and you have to find its sum. >>>reduce(lambdax,y:x+y,[1,2,3])6 You can also define an initial value. If it is specified, the function will assume initial value as the value given, and then reduce. It is equivalent to adding the initial value at the beginning of the list. For example: >>>reduce(lambdax,y:x+y,[1,2,3],-3)3>>>fromfractionsimportgcd>>>reduce(gcd,[2,4,8],3)1 Input Format First line contains , the number of rational numbers.The  of next  lines contain two integers each, the numerator(  ) and denominator(  ) of the  rational number in the list. Constraints     Output Format Print only one line containing the numerator and denominator of the product of the numbers in the list…