Consider the following grammar.

$S$aDDe

$DF|G|$

$Ff|h|$

$Gc|d|$

Suppose we want to parse the input "adhe" using the top$-$down parsing algorithm with a stack, and a configuration is given as a pair $($stack$\_$contents, unconsumed$\_$input$).$ The first configuration is $($s$,$ adhe$).$ What is the fifth configuration?

The correct answer is: $($eDd$,$dhe$)$