Problem $5$: Max Adjacent In this problem, you$$ll implement a function that takes a list of numbers and returns a pair: a sum and a Boolean vector of the numbers that are summed. The condition is that the sum is maximum and that no adjacent numbers can be used. For example, $1$ data$5=[[5,1,4,1,5],[5,6,2,4],[4,5,1,1],[1,5,10,4,1],[1,1,1,1,1]]2$ for d in data$5$ : $3$ print $($ max$\_$adjacent $($ d $))$