IT THEORY FUNDAMENTAL

For this question to be done, you must have access to the book: 
Rosen, K. H. (2011). Discrete mathematics and its applications (7th ed.). New York, NY: McGraw-Hill. 
Section 4.2, “Integer Representations and Algorithms”
This section introduces binary, octal, decimal, and hexadecimal numeric representations and how to convert between these representations.
Section 2.1 and 2.2, “Sets” and “Set Operations”
These sections introduce set notation and the basic properties of sets including set elements, subsets, set equality, unions, and intersections. Venn diagrams are introduced to facilitate modelling and interpreting sets.
Section 10.1, “Graphs and Graph Models”
This section introduces graphs as a representation of relationships between multiple items in a set. Vertices represent items in a set, and edge represent connections or relationships between them. Different types of graphs allow different relationships to be presented.
Section 11.1, “Introduction to Trees”
This section introduces trees, a special type of graph that is particularly common for organizing sets of data in computer systems. Terminology associated with trees, such as parent, child, depth, root, leaf, and balanced, is introduced.
Check your answers against the solutions at the end of the book. Your Instructor will check that you have submitted all exercises but will not evaluate specific exercises. Questions regarding the solutions should be posted to the Unit 1 Support Forum.
Complete the following exercises, showing your work, and explaining where necessary:
Section 4.2, Exercises 1c, 3c, 5b, 7b, 11, 17 (pp. 255)
Section 2.1, Exercises 1a, 1c, 7a, 7c, 7d. 13, 15, 16 (pp. 125-126)
Section 2.2 Exercises 1a, 1b, 1c, 1d, 3a, 3b, 3c, 3d (pp. 136)
Section 10.1 Exercises 3, 5, 7, 9, 15, 19, 21 (pp. 650)
Section 11.1, Exercises 1a, 1b, 1c, 1d, 1e, 1f, 3a, 3d, 3e, 7, 9b (pp. 755)