Can you provide an example of a leftmost derivation parse tree for the keyword "algorithm"?

A leftmost derivation parse tree for the keyWord "algorithm" would start with the initial symbol S and then branch out to the terminals and non-terminals in a leftmost manner, showing the step-by-step derivation of the Word "algorithm".