Regex Generator

Description

Given two words—the “good” word and the “bad” word—you need to output 5 regexes and 5 extra words as pairs. Each regex must match the good word and its paired extra word, but none of the other words (the bad word or other extra words).

For instance, if your words where apple banana, you might output:

applex? applex
applx?e applxe
appx?le appxle
apx?ple apxple
ax?pple axpple

Each word will and must consist only of ACII lower case letters.

The judge will attempt to figure out your pattern and generate adversarial examples.

IO format

Input will be a list of tab separated words, first representing the good word, the second the bad word.

Each output must be 5 lines each with 2 words, first representing the regex the second representing the extra word. Each output should be separated by a double newline.

Regex Specification

We use JavaScripts Regular Expression Syntax.