Give a regular expression for binary numbers. They can be integers or binary fractions. A leading - sign is always allowed. Leading 0's are not allowed except when the integer part is 0. When the binary points is present, then neither the integer part nor the fractional part are allowed to be empty. If the integer part has more than 3 bits, then grouping with commas is required. Examples: Allowed: -0 1,111,010 -1,111.00 Not allowed: .11 1000 The 4-letter alphabet consists of 0, 1, dot, and comma.

Write a method replacekey in the minheap class with the following signature: public void replacekey(integer oldkey, integer newkey) the method will replace the first occurrence of oldkey with the newkey, and restore the min-heap property after the change. if the oldkey does not exist in the heap, the method prints an appropriate message and returns without changing the heap. example: suppose our binary heap object (bh) has the following keys: *** 4 6 7 32 19 64 26 99 42 54 28 then the method call: bh. replacekey (oldkey integer(54), newkey integer(2))

Andrina writes letters that are regularly sent to hundreds of her company’s customers. because of this, she would like for the mail merge command to be in her quick access toolbar, and she wants it to be the first button on the left. what should andrina do to place the mail merge button there?

When using a public computer or network, you should always