PLEASE LET ME KNOW SOON

How do you do dynamic examination and static examination of this program?

1 import Date. List 3 infix1 5 :+ data QuiltProg = A Turn QuiltProg iltProg +: QuiltProg deriving S 9 type QuiltData= [String] 10 11 prog1 = Turn(Turn(Turn B)) :+: Turn B :+1 Turn(Turn ) :+: B 2 Turn(B :+: Turn(Turn A))+Turn(Turn(Turn A): A) proga-Turn(B Turn(Turn B)) 13 14 15 16 :+: Turn(Turn A : Turn(Turn(Turn A))) : progE Turn(Turn A) B Turn (Turn(Turn A) - :+1 :+1 :+: B) 18 execute: QuiltProg-I0) 19 execute q-putStrLn (showPat(calc q)) 20 21 calc::0uiltProg? QuiltData 22 calc A = [noo" , "loo", "o-\"] 23 calc B-I"oo"o",N 24 calc(Turn q)turn (calc q) 25 calc(q:+: r) = sew (calc q) ( calc r) 26 27 conc_a11 :: [[t]]-> [t] 28 conc all foldr ) 29 30 showPat - conc all map (+"In") 31 32 sew#zipliith (++) 34 turn::[[Charll-[Charl] 35 turn istofChar map reverse.transpose $ map (map turnChar) listofChar 36 turnChar::Char->Char 37 turnChar.I'='-' 39 turnChar'/'='\' 4