### Question:
PrimeFactoryAlgorithm extends AlgorithmLevelImpl { @Override public String get(int number) { String result = ""; if (number == 1) { return "[1]"; } for (int i = 2; i < number / (i - 1); i++) { while (number % i == 0) { number /= i; result += String.valueOf(i) + ","; } } if (number > 1) { result += String.valueOf(number) + ","; } result = result.substring(0, result.length() - 1); return "[" + result + "]"; }  @Override String get(int number); @Override String description(); @Override int complexity(); @Override String author();  }### Answer:
@Test public void shouldWork() { PrimeFactoryAlgorithm algorithm = new PrimeFactoryAlgorithm(); assertEquals("[1]", algorithm.get("1")); assertEquals("[2]", algorithm.get("2")); assertEquals("[3]", algorithm.get("3")); assertEquals("[2,2]", algorithm.get("4")); assertEquals("[5]", algorithm.get("5")); assertEquals("[2,3]", algorithm.get("6")); assertEquals("[7]", algorithm.get("7")); assertEquals("[2,2,2]", algorithm.get("8")); assertEquals("[3,3]", algorithm.get("9")); assertEquals("[2,5]", algorithm.get("10")); assertEquals("[11]", algorithm.get("11")); assertEquals("[2,2,3]", algorithm.get("12")); assertEquals("[13]", algorithm.get("13")); assertEquals("[2,7]", algorithm.get("14")); assertEquals("[3,5]", algorithm.get("15")); assertEquals("[2,2,2,2]", algorithm.get("16")); assertEquals("[17]", algorithm.get("17")); assertEquals("[2,3,3]", algorithm.get("18")); assertEquals("[19]", algorithm.get("19")); assertEquals("[2,2,5]", algorithm.get("20")); assertEquals("[3,7]", algorithm.get("21")); assertEquals("[2,11]", algorithm.get("22")); assertEquals("[23]", algorithm.get("23")); assertEquals("[2,2,2,3]", algorithm.get("24")); assertEquals("[5,5]", algorithm.get("25")); assertEquals("[2,13]", algorithm.get("26")); }