Solve this question by this ID 421902575

Assignment 1 Instructions: - Submit your homework through Blackboard only. - Use Microsoft Word. Hand written solutions will not be accepted. - Save your file on your computer as PDF, and submit it as PDF only on Blackboard. - Write your name and full ID at the top of your solution document. - Submission after deadline will not be accepted and no extensions will be granted under any circumstances. - Copying from a friend or the internet is not allowed. Similar or copied works will not be granted any marks. Your work shall be checked for for copying by a Plagiarism Tool. - Do not use your mobile camera to scan your solution. Submissions taken by a mobile camera will lose some marks. - You will have one attempt only to make a submission. So make sure you check your work before you submit it. - Make sure you submit your solution well before deadline. Submission problems may happen near the submission deadline. Assignment details: 1. Assume the relation R over the set {0,1,2,3,4,5,6,7,8,9} obtained by combining adjacent (neighboring) digit pairs of your ID, keeping the same order of digits. For example, if my ID is 12345678 , then my relation R would be {(1,2), (3,4),(5,6),(7,8)}. If your ID has an odd number of digits, then repeat the last digit. [1.5 marks] 2. Determine if the relation is Reflexive, symmetric, antisymmetric, or transitive (Use a table).[2 marks] 3. Represent your R by a graph, and specify what type of graph can be used to represent this relation. [ 2 mark] 4. Generate a matrix (M2) for your relation R. [ 2 marks] 5. Generate the matrix for the composition of R and R(Mmax) for your relation. [2.5 mark]