Number of paths is as follows:
Starting from HGB: HGBA, HGBCA, HGBCDA, HGBCEDA, HGBCEFDA (Total 5 paths)
Starting from HGC: HGCA, HGCBA, HGCDA, HGCEDA, HGCEFDA (Total 5 paths)
Starting from HGE: HGECA, HGECBA, HGECDA, HGEDCA, HGEDCBA, HGEDA, HGEFDCBA, HGEFDCA, HGEFDA (Total 9 paths)
Starting from HEG: HEGBA, HEGCBA, HEGCA, HEGCDA (Total 4 paths)
Starting from HEC: HECGBA, HECBA, HECA, HECDA (Total 4 paths) Starting from HED: HEDCBGA, HEDCBA, HEDCA, HEDA (Total 4 paths)
Starting from HEF: HEFDCGBA, HEFDCBA, HEFDCBA, HEFDCA, HEFDA (Total 5 paths)
Starting from HFE: HFEGBA, HFECGBA, HFECBA, HFECA, HFEDCGBA, HFEDCBA, HFEDCA, HFEDA, (Total 8 paths)
Starting from HFD: HFDEGBA, HFDEGCA, HFDEGBCA, HFDECGBA, HFDECBA, HFDECA, HFDCEBGA, HFDCGBA, HFDCBA, HFDCA, HFDA (Total 11 paths)
Total number of paths is: 5 + 5 + 9 + 4 + 4 + 4 + 5 + 8 + 11 = 55
Hence , the total number of paths from city H to city A is 55 .
First is produced by the action of second.
First is the left-over of the second.
Based on the matrix, (d) is the right answer
Based on the matrix, (b) is the right answer
All others are consonants.
All are the cities of Uttar Pradesh.
The statement is of the type 'when A then B, when not B then not A' where A is 'they submit form' and B is 'all ineligible students do not get admission'.
All the numbers except '52' are divisible by 12.
Comments
There are no comments.Copyright ©CuriousTab. All rights reserved.