Given two positive numbers, num$\_1$ and num$\_2,$ the function returns True if after removing all

sequences of repeated digits from both integers and replacing it with only one instance, num$\_1$ is

equal to nu$\_2,$ False otherwise.

$$ You are NOT allowed to type convert num to a string $,$ use lists in any form, add

the digits into a list to traverse or process the number, or to use of the math module

Preconditions and Postconditions

num$\_1$: int $->$ positive integer

num$\_2$: int $->$ positive integer

Returns: bool $->$ True is num$\_1==$num$\_2$ after removing sequences of repeated

digits, False otherwise

Example:

$>>>$ is$\_$identical$(51111315,51315)$ #$1111$ is replaced with $1,51315==51315$

True

$>>>$ is$\_$identical$(7006600,7706000)$ # $7060==7060$

True

$>>>$ is$\_$identical$(135,765)$

False

$>>>$ is$\_$identical$(2023,20)$

False

Question #$5$: frequency$($txt$)5$ pts

Returns a dictionary with the frequency count of each alphabet letter $($in lowercase$)$ in txt$.$ You

cannot make assumptions about the contents in txt$.$

Preconditions and Postconditions

txt: non$-$empty str

Returns: dict $->$ frequency count

Useful methods:

$$ The str$.$isalpha$()$ method returns True if all characters in the string are alphabetic and there

is at least one character, False otherwise.

o $\text{'}$s$\text{'}.$isalpha$()$ returns True

o $\text{'}9\text{'}.$isalpha$()$ returns False