Hoare Logic: Extensions Consider the rules for Hoare logic, .e., the rules for combining Hoare triples for inferring proerties of a given program. In this problem, we are going to extend Hoare logic for new constructs of programs 1. Consider the following if-then-elseif-else statement if C1) then Si; elseif C2) then S3; elseif(C.-1) then Sk-1 else Sk; Combine the existing proof rules in hoare logic to infer the pre and post conditions of the above given if-then-elseif-else program construct Hoare Logic: Extensions Consider the rules for Hoare logic, .e., the rules for combining Hoare triples for inferring proerties of a given program. In this problem, we are going to extend Hoare logic for new constructs of programs 1. Consider the following if-then-elseif-else statement if C1) then Si; elseif C2) then S3; elseif(C.-1) then Sk-1 else Sk; Combine the existing proof rules in hoare logic to infer the pre and post conditions of the above given if-then-elseif-else program construct