Please solve asap using python 3
![R<br>!<br>2:12<br>Paytm<br>hackerearth.com/challe<br>2<br>Prefix sum is the cumulative sum of a<br>sequence of numbers ao, a1,<br>an-1<br>It is itself a sequence of numbers<br>bo, b1,bn-1 such that<br>5<br>PreSumo<br>PreSumi<br>PreSum2<br>PreSumo a1<br>= a0+a1 =<br>PreSum<br>= a0 +a1ta2<br>PreSum,n-1 an<br>PreSumn<br>-<br>Prefix sum operations can be generalized to<br>any binary operator<br>Prefix sum operation takes a sequence of n<br>elements [ao, a1,<br>an] and returns a sequence<br>[ао, (ао @ а1),<br>(ао @ ај ө аz ... Ө ап) ]<br>containing the prefix sums.<br>For example:<br>A[] = 1,3, 4,5, 2, 7, 8,11<br>The prefix sums corresponding to A will be<br>?<br>PreSum<br>1,4, 8,13, 15, 22, 30, 41<br>LIVE EVENTS<br>](https://s3.us-east-1.amazonaws.com/storage.unifolks.com/qimg-008/008_5xz0-tymvb0pq.png)
Extracted text: R ! 2:12 Paytm hackerearth.com/challe 2 Prefix sum is the cumulative sum of a sequence of numbers ao, a1, an-1 It is itself a sequence of numbers bo, b1,bn-1 such that 5 PreSumo PreSumi PreSum2 PreSumo a1 = a0+a1 = PreSum = a0 +a1ta2 PreSum,n-1 an PreSumn - Prefix sum operations can be generalized to any binary operator Prefix sum operation takes a sequence of n elements [ao, a1, an] and returns a sequence [ао, (ао @ а1), (ао @ ај ө аz ... Ө ап) ] containing the prefix sums. For example: A[] = 1,3, 4,5, 2, 7, 8,11 The prefix sums corresponding to A will be ? PreSum 1,4, 8,13, 15, 22, 30, 41 LIVE EVENTS
Extracted text: R ! 2:12 Paytm hackerearth.com/challe 2 Input: Take a list as input. Output: 5 Print the following things: The minimum number and its position in the given list. The maximum number and its position in the given list. Number of Distinct elements in input list. Prefix Sum of the given list. SAMPLE INPUT 1,3,4,5,2,7,8,11 SAMPLE OUTPUT 1 1 11 8 ? 14 8 13 15 22 30 41 LIVE EVENTS