How is a problem usually reduced with a recursive module? What will the following program display? Module main() Declare Integer num = 0 Call showMe(num) End Module n = 0 factorial ( n ) = 1 n >...

How is a problem usually reduced with a recursive module?

What will the following program display?

Module main()

Declare Integer num = 0

Call showMe(num)

End Module

n = 0 factorial ( n ) = 1

n > 0 factorial ( n ) = n × factorial ( n − 1)

Module showMe(Integer arg)

If arg <>

Call showMe(arg + 1)

Else

Display arg

End If

End Module