Explain what is De Morgan’s Law. State with example.‘S>r ‘m°J©Ýg bm° ’ H$mo n[a^m{fV H$s{O¶o VWm Cn¶wº$ CXmhaU XoH$ag‘PmB¶o&b) Do as directed :i) (6E)16 = ( ) 10 = ( )2ii) (1011011101101110)2 = ( ) 16 = ( )10https://www.rgpvonline.com

De Morgan's Law is a fundamental principle in the field of Boolean Algebra and digital electronics. It is named after Augustus De Morgan, a 19th-century British mathematician. The law presents a way of expressing logical ANDs and ORs in terms of each other.

De Morgan's Law states that:

1. The negation of a conjunction is the disjunction of the negations. In other words, NOT (A AND B) is the same as (NOT A) OR (NOT B).
2. The negation of a disjunction is the conjunction of the negations. In other words, NOT (A OR B) is the same as (NOT A) AND (NOT B).

For example, if we have two statements A: "It is raining" and B: "It is cold", then according to De Morgan's law:

• NOT (A AND B) would mean "It is not the case that it is both raining and cold", which is the same as saying "It is not raining OR it is not cold".
• NOT (A OR B) would mean "It is not the case that it is either raining or cold", which is the same as saying "It is not raining AND it is not cold".

Now, for the conversion of numbers between different bases:

i) (6E)16 = (110)10 = (1101110)2 ii) (1011011101101110)2 = (BDB6)16 = (48534)10

Please note that the hexadecimal system uses digits from 0 to 9 and then A to F to represent 10 to 15.