Given a string of characters without any spaces between them and a dictionary of valid English words, find all possible ways to break the string in individual dictionary words. 002) Examples: dictionary["T" "have", "Sam", "am", "this", "dog"] String "IamSam" Output: "I am Sam" String"thisisadog" Output: String can't be broken a) Design the recursive sub-problem condition(s) b) Use your solution in (a) to solve the following problems: You have to show the complete solution of the DP steps either by top down or bottom-up approach. dictionary- ['"I" , "KU", "study", "CpE", "in"] 1st string input: "IstudyCpEinKU" 2nd string input: "IstudyEEinKU" d What i the ninnina time of vour alaorithm2