Find the similarities and differences between the following two algorithms:

The answer is supposed to touch on how the algorithms each move through their respective tree representations. Any help would be great!

YETANOTHERMOTIFSEARCH(DNA, t, n, l) 2 bestMotif FIND (s, 1, t, n, l) return bestMotif 3 FIND (S, currentSeq, t, n, l) 1 icurrentSedq 2 bestScore 0 3 for j 1 to n-1+1 5 bestPossibleScore- Score(s, i) (t - i) 6 7 if best PossibleScore best Score if currentSeqtt s FIND(s, curYentSeq + 1, t, n, l if Score(s) > bestScore 10 bestScoreScore(s) bestMotif_s 12 return bestMotif YETANOTHERMOTIFSEARCH(DNA, t, n, l) 2 bestMotif FIND (s, 1, t, n, l) return bestMotif 3 FIND (S, currentSeq, t, n, l) 1 icurrentSedq 2 bestScore 0 3 for j 1 to n-1+1 5 bestPossibleScore- Score(s, i) (t - i) 6 7 if best PossibleScore best Score if currentSeqtt s FIND(s, curYentSeq + 1, t, n, l if Score(s) > bestScore 10 bestScoreScore(s) bestMotif_s 12 return bestMotif