3. (a) Suppose that G is a weighted directed graph that shows different paths from home to office as follows, where the weight of the edge from vertex 8 to vertex 9 is the "last two digits of your ID". Now, we want to seek the shortest path for driving from home to office. Find the shortest path considering node 1 as the starting node to all other nodes using Dijkstra's algorithm and show each step in detail. 12 15 Home 15 Office

Mutual authentication is shown by withdrawing money using your PIN and ATM card.True False

Cryptography: Alice’s modulus is 11292367, her public exponent is e=94321 and her private exponent is d=6327241.  Use RSA to sign the message:  x=08041115

Is there a better way to keep a password than to encrypt it?