Expected Behavior

max$\_$consec$\_$sum$($numbers$,$ n$)$ returns the maximum sum of n consecutive elements of numbers, a list that contains any mix of ints and floats.

Examples:

$>>>$ max$\_$consec$\_$sum$([10,2,-3,4,3],1)$

$10$

$>>>$ max$\_$consec$\_$sum$([10,2,-3,4,3],2)$

$12$

$>>>$ max$\_$consec$\_$sum$([10,2,-3,4,3],3)$

$9$

$>>>$ max$\_$consec$\_$sum$([10,2,-3,4,3],4)$

$13$

$>>>$ max$\_$consec$\_$sum$([10,2,-3,4,3],5)$

$16$

Assume that $1<=$ n $<=$ len$($numbers$)$ and that numbers has at least one element.

Challenge!

See if you can write this function with only one loop, i$.$e$.,$ only a single for or while.