New function! You can edit the text in the PDF directly! PDF Edit Discrete Mathematics (MASC0310) - Spring-2020 -CW (Assignment 2) - A&B-QP 6) Find the following expression, which is given in the prefix notation 7-*5+2 y 75 x and evaluate when x = 5 and y = 2 (10 Marks) 71 a. Draw a simple graph of five vertices (3 Marks) b. Draw a complete graph of 6 vertices (3 Marks) C. Match the best (4 Marks) 1 Connected graph with no circuit Connected graph with 15 edges. 2 Complete graph with 6 vertices B Euler graph C Tree 3 Graph with zero multiple edges and four odd degree vertices 4 Graph with all the vertices of even degree D Simple graph 81 a. By using Kruskal's algorithm find the shortest spanning tree for the following graph: (6 Marks) B 5 H b. Determine if relation is a tree by drawing the graph and if it is, find the root. RI = {(1,2), (1, 3), 3, 4), (5,3), (4,5) il R2 = {(1,8), (5, 1), (7,3), (7,21.17.4), 14,6), (4,5)} (2 Marks (2 Marks) (4 Marks) 9) a. Let A = lef, h), then write all the permutations of A. b. Find the algebraic expression of the following given in postfix notation: 16 Marks) 2 x 4-2/8 4. 214/+ MEC AMO TEM_034_01 Page 3 of 9 Discrete Mathematics (MASC 0310) - Spring-2020 -CW (Assignment 2) - A&B-QP 10) a. let A-(1,2,3,4,5,6), write the permutation pc 3 i 54 C) as the product of disjoint cycles (4 Marks) b. Define the following: (2 Marks) 1. Euler tour Hamilton path (2 Marks) Il. c. How many edges will be there in a complete graph with 13 vertices. (2 Marks)