using java

Imagine that you are a super rich person and you want to buy a house to your two best friends. You want them to be your neighbours. Yet, of course, just because you are rich doesn't mean you have unlimited money. There is a set of prices of houses you can find with similar qualifications like following: {3200000, 3400000, 3000000, 4200000, 3500000, 3800000} Design and implement a way of finding the minimum two prices, sum up them, and display. While finding these numbers, make sure that you are using one searching and one sorting algorithm and overall complexity of these algorithms are no more than quadratic time. You should also write your design in a few sentences as a comment. Explain how and why you choose that solution in detail