In this discussion, we will be exploring the relation defined by "mod n".; As shown in the modules notes page, the remainder mod n is an equivalence relation. Modular arithmetic or clock arithmetic has applications ranging from ISBN verification to credit card number checks and computing time on our standard "mod 12" clock. For your initial post, include: 1. A subject line that indicates yvour "n" value and whether you're working on a multiplication or addition table 2. Based on the first letter of your first and last names, show either the addition or Captioned version of Addition table mod 12 multiplication table. Groups First letter of first name... A-E F-J K-O P-T U-Z *If your last name begins with A-L, do an addition table. If you last name begins M- Z, do a multiplication table. For example, if my name was Marika Ellison, | would use n=8 and: do an addition table. Create your initial post by Thursday. If you need to revise and change your work, you can revise and reply in your thread. | will grade the last post you have in your thread for accuracy. By Sunday, create 2 or more replies: For your first reply, compute [100] + [27] mod n. Use the "n" of the student yvou're replying to. For your second reply, compute [2]*([56] + [12]) mod n. Use the "n" of the student yvou're replying to. If you spot an error, courteously inquire and ask for clarification. Feel free to post additional replies with questions or patterns that you notice