Description
Note:

Late submissions receive zero credit.

If you write only the correct answer without steps you get very low credit.

Submit in hard form.

Do not knock at the door. Just slide beneath the door.

Total marks are 40
________________________________________________________________
Q: 1 Write a program that will accept a proposition in one of the following forms [Points 40]

Implication

Converse

Inverse

Contrapositive.
And then convert it into its corresponding other three forms. For instance, If I provide the proposition in implication form ¬p → q then it should compute the remaining three forms. Your program should have two inputs. One for the input proposition and another one for the types of the proposition which can be either implication, converse, inverse or contrapositive.
Test your program with the following.

¬p → q (Contrapositive)
2. ¬p → q (Inverse)


¬p → q (Converse)



¬p → q (Implication) Submit to me:


Your program source code

Run all the test cases showing clearly all the output from your program. For each test case, there should be three outputs. (If you took a print and I am unable to see the output then you will not receive any marks)
Good luck