Define the function 'sub-pattern' that takes two SIMPLE lists pat and str and returns the sublist of str if pat is a substring of str. Otherwise it returns nil. Example: (sub-pattern '(c a c) '(b a j a c a c t u s)) --> (c a c t u s)

Which of the following best describe how the depth-limited search works. a normal depth-first search is performed but the number of ply/depths is limited. a normal breadth-first search is performed but the number of ply/depths is limited. a normal breadth-first search is performed but values above a specific value will be ignored. a normal depth-first search is performed but values above a specific value will be ignored.