Part $1$: Maximum Subset Sum with Non$-$Adjacent Elements Description: Given an array of integers, use recursion to find the maximum sum of a subset where no two elements are adjacent. To optimize, apply memoization or dynamic programming techniques to store results of previously computed subproblems. Example: Given the array: $[3,2,7,10]$ The maximum subset sum with non$-$adjacent elements is $3+10=13.$ Part $2$: Word Break Problem Description: Given a string and a dictionary of words, use recursion to determine if the string can be segmented into a space$-$separated sequence of one or more dictionary words. Example: Given the string: "applepie" Dictionary: $["$apple$",$ "pie", "pear"$]$ The string "applepie" can be segmented as "apple pie", so the function should return True.