Find the weakest precondition and prove the correctness of the following loop (Daniel) count = n; fact = 1; while count 0 do fact = fact * count; count count 1; end {fact = n! }