Given a computing problem, if we can use the brute force method to get the best solution, then we cannot treat this problem as a hard problem. O True False We want to compare the efficiency between the selection sort and the bubble sort. Given an array without any inversion, which one do you think performs better? selection sort better O bubble sort better essentially the same Given an array with these four elements: 4, 2, 3, 1, how many inversions can you find in this array