ignore this text. You are the owner of a startup comapny that requires the purchase of -a time. there are n vendors, each capable of providing a unique subset of these items. let's denote the subset of tha vendor i( where i=1,n ) can set V. Each item i in the subset V has an associated cost c the goal is to minimize the total cost of acquiring of the items. a)represent this purchasing scenario as a graph. define the vertices, edges, and how you would assign weights to these edges based on the vendors, items, and costs provided. b) Using part a, explain how a minimum panning tree can be used in this instance to achieve the mhimum cost. (add additional nodes, edges, costs)