If we generalize from the stop-and-wait protocol to a sliding window protocol, where \textit{k} packets can be sent but unacknowledged, what is the minimum number of distinct sequence numbers that we would need for this protocol to work correctly

Hey i really need some solving this problem: 1. encrypt this binary string into cipher text: 110000. include in your answer the formula the decoder would use to decrypt your cipher text in the format (coded answer) x n mod (m) = y & 2. decrypt this cipher text into a binary string: 106 you.