So I am working on a project and I'm struggling to figure out how to get my SQL Queries to show in a website with Php. Here's the portion I'm struggling with. You will model your files and site for this project after what you did in the previous assignment. Use the index. php includes file attached to this assignment to create a main page where a navigation link exists for each of the queries below. Show the question, the SQL query itself and the query results when the link is clicked. Structure your code so that you use an index. php file, a header. php file, a content. php file, a nav. html file and a footer. php file as in the previous PHP includes template assignment. As before, there should be a main folder (called p1 where is your initials … i. e., mine would be LLCp1) with all of these files in it. There should also be an includes folder that has six (6) php files in it as named below for the SQL Queries section (one for each of the queries below) as well as a database php file (called db. php). Make sure you also have a db. php file in the includes folder as well and set the password to an empty string "" in it (see file attached here for sample). This php file should be included in the index. php file.

3. bob is arguing that if you use output feedback (ofb) mode twice in a row to encrypt a long message, m, using the same key each time, it will be more secure. explain why bob is wrong, no matter what encryption algorithm he is using for block encryption (15 points).

For this assignment you have to write a c program that will take an infix expression as input and display the postfix expression of the input. after converting to the postfix expression, the program should evaluate the expression from the postfix and display the result. what should you submit? write all the code in a single file and upload the .c file. compliance with rules: ucf golden rules apply towards this assignment and submission. assignment rules mentioned in syllabus, are also applied in this submission. the ta and instructor can call any students for explaining any part of the code in order to better assess your authorship and for further clarification if needed. problem: we as humans write math expression in infix notation, e.g. 5 + 2 (the operators are written in-between the operands). in computer's language, however, it is preferred to have the operators on the right side of the operands, ie. 5 2 +. for more complex expressions that include parenthesis and multiple operators, a compiler has to convert the expression into postfix first and then evaluate the resulting postfix write a program that takes an "infix" expression as input, uses stacks to convert it into postfix expression, and finally evaluates it. it must support the following operations: + - / * ^ % ( example infix expression: (7-3)/(2+2) postfix expression: 7 3 2 2 result: rubric: 1) if code does not compile in eustis server: 0. 2) checking the balance of the parenthesis: 2 points 3) incorrect postfix expression per test case: -2 points 4) correct postfix but incorrect evaluation per test case: -i points 5) handling single digit inputs: maximum 11 points 6) handling two-digit inputs: 100 percent (if pass all test cases)

You draw two cards from a standard deck of 52 cards, but before you draw the second card, you put the first one back and reshuffle the deck. (a) are the outcomes on the two cards independent? why?