need answers as soon as possible

be used. Attempt al rable but not compulsory that all parts of a question be solve consecutively at one place. In case there are multiple attempts of a question then only the first one whic is not crossed out, would be marked and the rest would be neglected. Cell-phones must be switcheda during the examination. B E Qia-CLO2 (2): Write the adjacency matrix for the graph in Figure 1. QID-CLO2 (8): Find a minimum cost spanning tree on the graph shown in Figure I using Kruskal's algorithm. 13 3 25 -14 11 16 A A 45 23 -15- 17 33 19 36 41 F F Figure 1 Q2- CLOI (8): The extended Euclidean algorithm is an algorithm to compute integers a and b such that ax + by = ged(x,y) If the inverse exists, following equation is satisfied ax + by = ged(x,y) = 1 where. I is the value ofd after computation of GCD. For the following equation, check whether inverse exists or not using extended GCD algorithm provided on right side. If the inverse exists, find minimum value of x. 5x = 6 (mod 8) algorithm extended-ged {x,y) if Y - Other coturnix.. else (d, a, b) :- extended-gedly. * (mod return ((d, b, a - (x div y) . b) Q3 - CLOT (4): Suppose that Ali wants to send a message x to Ahmed. Using RSA scheme for Public-Key Cryptograph general equations for encrypted message sent from Ali's side and decrypted message at Ahmed's side. Q4 - CLO2 (8): The matrix below shows the time, in milliseconds, it takes to send a packet of data between computers network. If data needed to be sent in sequence to each computer, then notification needed to come back to the original we would be solving the Travelling Salesman Problem (TSP). The computers are labeled A-F for convenience. 44 14 12 20 1 24 43 24 20 39 71 c C 29 34 20 D 11 24 20 4 2 a Find the circuit generated by the NNA starting at vertex B. b) Find the circuit generated by the RNNA. 04-CLO2 (5): Which of the graphs in Figure 2 have an Eulerian walk? Which of them wave a closed Eulerian walk? Find an Eulerian walk if it exists. -CLO2(5): Draw the 8 node tree whose Prfer code is (4 02 40.40). Figur