please hand trace this code when i = 0 and

i = 1

Maximum subsequence sum solution # finds the max subsequence sum in the list values def max_subsequence_sum_1(values): size = len(values) max_sum = 0 i = 0 while i max_sum): executed? max_sum = this_sum J = 1 + 1 i= 1 + 1 Can you/we do better? return(max_sum) Adapted from 2011-12 Shutter & McQuin c5 2106