$(1)$

Given a list of integers write an efficient dynamic propram to find the max. sum of a sublist of the list such that no two eleverts. of the sublist are adjacut in the original list. Compute its time complexity. For exauple gives the list $5,19,1,8,22$ the max. fun would be the sublist. $19,22$ which has a sum of $41?$

Note: Please do the full selution, for example, draw graphs.