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. 0(2) 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) 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. b) dictionary ("I" , "KU", "study", "???", "in"] 1s string input: "IstudyCpEinkU" 2nd string input: "IstudyEEinKU c) What is the running time of your algorithm? Note: your solution must not run in exponential time. 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. 0(2) 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) 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. b) dictionary ("I" , "KU", "study", "???", "in"] 1s string input: "IstudyCpEinkU" 2nd string input: "IstudyEEinKU c) What is the running time of your algorithm? Note: your solution must not run in exponential time