(Solved): Now Consider Möbius Transformations: These Are Functions That Take The Form Fi(x) = AiX + Bi Cix + ...
Now consider Möbius transformations: these are functions that take the form fi(x) = AiX + bi Cix + di Can g = (fn o fn-10...o fi) be efficiently computed in parallel? If so, give an algorithm for computing g. If not, argue why not.