Question: What are the major differences between searching and sorting in Java? What are some of the differences in the techniques used in selection sorting and merge sorting? How is the performance of a sorting algorithm determined in regard to big-Oh notation? In what instances can searching and sorting algorithms be used? Provide specific examples of each. After your initial post, respond to at least two peers in this discussion.