Which of the following are true for the depth first search algorithm? (Select all that apply) O(log(n)) worst case time complexity, where n is the number of nodes in the tree Commonly implemented using a queue More effective than breadth first search at finding the leaf that is closest to the root. O(n) worst case time complexity, where n is the number of nodes in the tree Commonly implemented using a stack Commonly implemented using recursion