bA digital signature scheme typically consists of three algorithms.

a$.$

A key$-$generation algorithm that selects a private key uniformly at random from a set of possible private keys. The algorithm outputs a private key and a corresponding public key.

b$.$

An algorithm that generates a fixed private key and a public$-$key and the keys cannot change.

c$.$

A signing algorithm that produces a signature for a given message using the signer's private key.

d$.$

A signing algorithm that produces a signature for a given message using signer's public key.

e$.$

A signature verification algorithm that either accepts or rejects the message's claim of authenticity for a given message and a signature using signer's public key.

f$.$

A signature verification algorithm that either accepts or rejects the message's claim of authenticity for a given message and a signature using signer's private key.

g$.$

a$,$ c$,$ and e$.$

h$.$

a$,$ d$,$ and e$.$

i$.$

b$,$ c$,$ and e$.$

j$.$

a$,$ d$,$ and f$.$

k$.$

b$,$ c$,$ and f$.$