6. Write a recursive function named search that takes as input the pointer to the root of a binary tree (not a BST!) and a value K, and returns true if the value K is found and false otherwise. (5 pts)

Arah has entered data about football players from team a and team b in a worksheet. she enters names of players from team a with details about each player in different columns of the worksheet. similarly, she enters details of all the players from team b. which option will her view the data for team a and team b in two separate sections after printing? a. page break view b. freeze pane view c. split screen view d. full screen view e. zoom out view