Step by Step solution about How to resolve the algorithm SHA-1 step by step in the Haskell programming language

The code provided is a program written in Haskell that computes the SHA1 hash of a given word. The program performs the following steps:

1. It imports the libraries Data.Digest.Pure.SHA and Data.ByteString.Lazy. The first library provides the functions to compute the SHA1 hash, while the second one provides the functions to manage byte strings in Haskell.
2. It defines a function convertString that converts a string into a byte string. The function uses the B.pack function from the Data.ByteString.Lazy library to pack the list of characters of the string into a byte string. The characters are first converted into their ASCII codes using the fromEnum function, and then the ASCII codes are converted into integers using the fromIntegral function.
3. It defines a function convertToSHA1 that computes the SHA1 hash of a string. The function uses the sha1 function from the Data.Digest.Pure.SHA library to compute the hash of the byte string obtained by calling the convertString function. The result of the sha1 function is a 160-bit hash value, which is then converted into a string using the showDigest function.
4. In the main function, the program takes the string Rosetta Code as input, calls the convertToSHA1 function to compute its SHA1 hash, and prints the result on the standard output.

module Digestor 
   where
import Data.Digest.Pure.SHA
import qualified Data.ByteString.Lazy as B

convertString :: String -> B.ByteString
convertString phrase = B.pack $ map ( fromIntegral . fromEnum ) phrase

convertToSHA1 :: String -> String
convertToSHA1 word = showDigest $ sha1 $ convertString word 

main = do
   putStr "Rosetta Code SHA1-codiert: "
   putStrLn $ convertToSHA1 "Rosetta Code"