This is a problem where the word ͞ĐhoĐolate͟ ĐaŶ ďe ŵadefroŵ the syŵďols of eleŵeŶts oŶ the periodic table like- "C", "H", "O", "C", "O", "La", "Te" using the symbols Carbon, Hydrogen, Oxygen, Lanthanum and Tellurium. Cobalt can also be used for the "Co" before "La". The word "banana" or "bananas" can be made with "Ba", "Na", "Na" and "S", but not with "N" because there is no "A" or "An" on the periodic table.

2. This is a problem where the word ho olate a e adefro the sy ols of ele e ts o the
periodic table like-
"C", "H", "O", "C", "O", "La", "Te"
using the symbols Carbon, Hydrogen, Oxygen, Lanthanum and Tellurium. Cobalt can also be used for the
"Co" before "La". The word "banana" or "bananas" can be made with "Ba", "Na", "Na" and "S", but
not with "N" because there is no "A" or "An" on the periodic table. Trying to use Nitrogen "N" would
appear to fail when checking the rest of the word, but using Sodium "Na" would work for the rest. So
one gotto try any combination of 1 and 2 letter element symbols. In this C program, determine if a
lowercase word can be made with any combination of 1 or 2 letter element symbols.
The list of chemical elements will come from a text file named chemelements.txtin which the 4 lines of
the file will each contain 25 atomic symbols. Input the filename from the keyboard. Let theuser enter
words to check for from the keyboard. Assume correct input (spelling). Output "Yes" or "No" for each
word indicating if it can be made from the element symbols.
The program is as follows:
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <ctype.h>
/* convert the word to lower case */
voidtoLower(char word[]);
/* read elements names from the given file
* convert their name into lower cases */
intreadElements(char filename[], char names[100][3]);
/* check if the word starting from index (pos) can be formed
* by using the element names in then names arrray */
int search(char names[100][3], int count, char word[], intpos);
int main()
{
char filename[256];
char word[256];
char names[100][3]; /* element names*/
int count;
/* ask the user to enter the filename */
printf("Enter the file name: ");
scanf("%s", filename);
/* ask the user to enter the word to search */
printf("nEnter the word: ");
scanf("%s", word);
toLower(word);
/* read the element names from the file */
count = readElements(filename, names);

3. /* search */
if (search(names, count, word, 0) == 1) {
printf("Yesn");
} else {
printf("Non");
}
}
/* convert the word to lower case */
voidtoLower(char word[])
{
int i;
for (i = 0; word[i] != 0; i++) {
/* convert to lower case */
word[i] = tolower(word[i]);
}
}
/* readingthe elements names from the given file and
* convert their name into lower cases */
intreadElements(char filename[], char names[100][3])
{
int count = 0;
FILE *in = fopen(filename, "r");
if (in == NULL) {
printf("Error: could not read file %s.n", filename);
exit(-1);
}
/* read names one by one until the end of file */
while (fscanf(in, "%s", names[count]) == 1) {
toLower(names[count]);
count ++;
}
fclose(in);
return count;
}
/* Here it is checked that if the word starting from index (pos) can
*be formed by using the element names in then names arrray */
int search(char names[100][3], int count, char word[], intpos)
{
int i;
intlen = strlen(word);
if (pos == len) {
/* already the end of word, thus its true */
return 1;
}
/* check if the part is one character in word,
* if the remaining word can be generated with element names */
for (i = 0; i < count; i++) {

4. int k = strlen(names[i]);
if (k == 1 && word[pos] == names[i][0]) {
/* found a matched single character element name,
* check the rest part */
if (search(names, count, word, pos + 1)) {
return 1;
}
}
}
/* In the below section it is checked that if the part is two
*characters in word,if the remaining word can be generated with
element names */
if (pos + 1 <len) {
for (i = 0; i < count; i++) {
int k = strlen(names[i]);
if (k == 2 && word[pos] == names[i][0] && word[pos + 1] ==
names[i][1]) {
/* found a matched two characters element name, then
* check the rest part */
if (search(names, count, word, pos + 2)) {
return 1;
}
}
}
}
return 0;
}