Exercise 1 - Total Covering Problem Consider the problem of location with the following - number of demand points Villapel dered by . : number of eligible sites to locate TV t i enindexed by L. ) Z0): covering zone set of points to be covered with the point Note that we don't use here a Covering Distance D. determine the covering ones, because distances become weak factors behind the presence of mountains separating the different villages. Indeed, mountain cut signal t o impossible flow . C opening cost of - The following graph shows villages (lanka ) and possible sites for location of TV transmitten lack squares. The numbers between parenthesis are the cost of TV trauma construction in millions of dollars estimated according to the selected site features The ellipse Crossing transmitters indicate the ranges (ie covered area if transmitter installed We want to choose the transmitters to be constructed in order to cover the all villages with the minimal cost Note that here. a) What is the name of this logistics optimization problem? (answer among: Single facility location, Total covering problem, Maximal Covering problem, p-center location problem median....) b) What is the Covering Matrix A ) - [?] c) Note that site opening cost vector (C) - (10, 8, 6, 5, 7) in MS Formate with a lica Program this