'Discrete Structure of Computer Science' . Topic is Graphs & Mappings. Please answer all the questions by showing proper steps and method. URGENT!!! Thanks

I dont have a more clear picture but please try to solve by seeing this. I wrote it down. Please solve and answer fast. URGENT!!! Thanks...

The second block (graphs and relations, mappings) 04 ( point). For the mapping from the set A = {2, s. . ) to the set B - (b.hu represented with following assignments aro (b), ap (ba, bs, bu). (b b ) (he) the image of the set (ai, a, a) and the preimage of the set (be, bs). Q5 (2 points). How many vertices and how many edges do W.graph has? Draw the example where n 6. 06 (3 points). Determine whether the given functions defined in the set of real numbers (geometrically depicted as the straight line of numbers) are bijections (if the decisions are not justified, the maximal assessment is 2 points) a) f(x)= x-1 b) f(x) - 4.4: For the mapping from the set A={0,92, 93, 94 ) to the set B = {bl, b2 b3 b4 } represented by wing assignments a, d= {b 2 }, and = 462, 63, 643 938 = {62, b33a4d = {by}. Define the image of the Set La,,a2, az} and the preimage of set of 62, B35. with following assignments and - Q.5: How many vertices and how many edges do wn a graph has ? Draw the example where n= 6. Q. 6: Determine whether the given function de fined in the set of real numbers (geometrically depicted as the stroight line of numbers) are bjection Cif the decisions are not justified, max. assesment is a pts). PLEASE ANSWER IT URGENTLY!!! Thanks