For Boolean function f=(x1x2) (x2+x3), please first find all of its prime implicants using K-map and construct the corresponding covering matrix. Each implicant may cover a part of dc-set, but not totally within a dc-set. Then, perform matrix reduction and find the min-cost cover. Finally, describe the min-cost cover solution in the form of SOP (sum of products). The cost here is the number of literals