Create a C program named semidrome.c that consists of a function bool is_semidrome(char *s) which determines whether or not a string s is a semidrome, that is, a concatenation of palindromes of length at least 2 (notice that palindromes of length at least 2 are themselves semidromes).

#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>

bool is_semidrome(char *s){
  if (s == NULL){
    return false;
  }
  if (s[0] == '\0'){
    return false;
  }
  if (s[1] == '\0'){
    return false;
  }

  int i, j;
  for (i = 0; s[i] != '\0'; i++){
    for (j = 0; j < i; j++){
      if (s[i] == s[j]){
        bool is_palindrome = true;
        int k, l;
        for (k = j, l = i; k < l; k++, l--){
          if (s[k] != s[l]){
            is_palindrome = false;
            break;
          }
        }
        if (is_palindrome){
          char *t = s +