Given the following function:

def sum$\_$scan$($l$)$:

result $=[0$ for i in range$($len$($l$))]$

for i in range$($len$($l$))$:

for j in range$($i$+1)$:

result$[$i$]=$result$[$i$]+$l$[$j$]$

return result

$($a$)$ Figure out what the function sum$\_$scan does and explain it with words.

$($b$)$ Write down the time complexity in big$-$O notation as a function of

being the length of the input list l$.$

$($c$)$ Can you think of an alternative algorithm for the sum$\_$scan function with a reduced order of time complexity? If yes, write it down the alternative sum$\_$scan function.