This question is about Discrete Math. I don't currently have the book and was wondering if someone could help me that either has the answers or the book.

Thank you in advance!

CS2233 Discrete Mathematical Structures Spring 2017 Homework 8 Due Friday 5pm 4/14/17 Please refer to the corresponding exercise sections in the textbook (Rosen, 7th edition). Justify all answers in order to receive full credit. Total points:100 1. n-ary Relations and Their Applications (page 589) (1) (8 points) Problem 2 on page 589 (2) (8 points) Show the resulting table when the following operation has been performed on table 5 on page 588: Select Department-Physics (3) (8 points) Show the resulting table when the following operation has been performed on table 6 on page 588: Project onto Department and Room (4) (10 points) Give the 1-join of Table 1 and Table 2 given below Table 1 Table 2 tment Name Computer Science 1337 Biology ourse Number CS 2233 CS 3333 MAT 1214 1337 2718 1337 Mathematics 3141 2. Graph Terminology and Special Types of Graphs (1) (9 points) Problem 10 on page 650 (complete for exercises 5, 6, 7) (2) (9 points) Problem 6 (page 689) (3) (24 points) For the graph G1 (a) Specify the set of vertices V (b) Specify the set of edges E (c) Give the degree for each vertex (d) Draw the directed graph that can be used to represent this undirected graph (e) Give the adjacency matrix representation for this graph. (Assume vertices are sorted lexicographically.) (f) Give the adjacency list representation for this graph (4) (24 points) For the graph G2 (a) Specify the set of vertices V. (b) Specify the set of edges E (c) Give the in-degree and the out-degree for each vertex (d) Give the adjacency matrix representation for this graph. (Assume vertices are sorted lexicographically.) (e) Give the adjacency list representation for this graph (f) How many strongly connected components are in the graph? List the vertices asso- ciated with each one