the materials needed for this course (text book And slides) are provided just message me

4. [Squared distance] (/20) Let A and B be the n x n adjacency matrices of two directed graphs with n vertices. The squared distance | |A - B| |2 can be used to express how different the two graphs are. Show that | |A - B| |2 is the total number of directed edges that are in one of the two graphs but not the other.5. {Resource requirements] (/20) We consider an application with 11 different job (types), each of which consumes m different resources. We dene the m X n resource matrix R, with entrj}r Riff giving the amount of resource i that is needed to run one unit ofjob j. for 21' = 1, - - ,m and j = 1, - ,n. The number of each of the different jobs to be processed or run is given by the entries of the n-vector ?. The entries of the m-vector ? give the price per unit of each of the resources. (a) Let 3} be the mvector whose entries give the total of each of the m resources needed to process the jobs given by Eh Express ' in terms of R and it using matrix and vector notation. (b) Let ? be an n-vector whose entries give the cost per unit of each job type. Express ? in terms of R and ? using matrix and vector notation