human
Dynamic Programming | High | Returns maximum amount of task that can be done till day n.
If n is less than equal to 0 , then no solution exists.
Determines which task to choose on day n , then returns the maximum till that day.
Driver Code"
How can the above be solved in Python?

Give me a code to dynamic Programming and the other steps required?
assistant
#Here is code to dynamic Programming and the other steps required.
 def maxTasks ( high , low , n ) :
	if ( n <= 0 ) :
		return 0
	return max ( high [ n - 1 ] + maxTasks ( high , low , ( n - 2 ) ) , low [ n - 1 ] + maxTasks ( high , low , ( n - 1 ) ) ) ;
if __name__ == " _ _ main _ _ " :
	n = 5 ;
	high = [ 3 , 6 , 8 , 7 , 6 ]
	low = [ 1 , 5 , 4 , 5 , 3 ]
	print ( maxTasks ( high , low , n ) ) ;