1) Given the tree below, in what order would a Depth First Search (DFS) algorithm visit each node until finding Chicago-style (starting at food)? (Assume nodes are pushed in left-to-right order.) Just list the order of nodes visited; no need to recreate the state of the algorithm data in your answer.

2. Consider the following code snippits:

def does_string_contain_letter(letter, string):

"""Determine whether a given letter is in a string."""

return letter in string

def contain_letters_in_common(string1, string2):

"""Determine whether the two strings have any letters in common."""

duplicates = []

for letter in string1:

if letter in string2:

if letter not in duplicates:

duplicates.append(letter)

return len(duplicates) > 0

A) What is the Runtime for does_string_contain_letter?:

B) What is the Runtime for contain_letters_in_common?: