## Question 1
What is the output if the following input string and dictionary are provided as input?

s = "pineapplepenapple"

word_dict = ["apple", "pen", "applepen", "pine", "pineapple"]
### Options

1. ["pine apple pen apple", "pineapple pen apple", "pine applepen apple"]
Correct
We get all valid combinations.
----------------------------

2. ["pine apple pen apple", "pine applepen apple"]
Incorrect
We are looking for all possible valid combinations.
----------------------------

3. ["pineapple pen apple"]
Incorrect
We are looking for all possible valid combinations.
----------------------------

4. []
Incorrect
A non-empty solution exists.
----------------------------

---------------------------------------------

## Question 2
What is the output if the following input string and dictionary are provided as input?

s = "cattos"

word_dict = ["cats", "cat", "to", "os"]
### Options

1. ["cat to os", "cat os", "cats to os"]
Incorrect

----------------------------

2. ["cat os", "cats to os"]
Incorrect
Congratulations, you got that right! There were no valid combinations from the words we had in our dictionary. 
----------------------------

3. ["cat to os"]
Incorrect

----------------------------

4. []
Correct
There are no valid combinations of the words we have in our dictionary.
----------------------------

---------------------------------------------

## Question 3
What is the output if the following input string and dictionary are provided as input?

s = "superdogs"

word_dict = ["super", "dogs", "dog", "s"]
### Options

1. ["super dogs", "super dogs s", "super dog s"]
Incorrect

----------------------------

2. ["super dogs", "super dog s"]

Correct
We get all valid combinations.
----------------------------

3. ["super dog s"]
Incorrect
We are looking for all possible valid combinations.
----------------------------

4. []
Incorrect
A non-empty solution exists.
----------------------------

---------------------------------------------