Question 14 Which problem would you catalog as a combinatorial search problem? O Traversing a binary tree in preorder O Adding two matrices O Finding all paths between two nodes of a graph O Finding the smallest number in an array Previous Question 13 In a randomized algorithm, worst-case scenarios happen rarely O often never always D Question 12 Select the correct choices (note that more than one might apply). In a Las Vegas algorithm, any time the algorithm is run with the same input output/result might be different time complexity is, at least, linear output/result is correct the sequence of computation steps might be different Previous