need help with PHP / HTML. Here is the assignment:

FOR THIS ASSIGNMENT YOU MUST SUBMIT IN TWO PARTS:

1. Upload your php file to the 163.238.35.165 server and put the URL in the comments section of the assignment. Make sure that I can access that URL when I type it into my browser!

2. Copy and paste your php file(s) into the submission section

Part I (We covered all this in class!)

Declare a one dimensional associative array that has at least 8 key/element pairs.

Print out the array in table form.

Print out the sorted array in table form.

Unset the second element in the sorted array.

Print out the reverse sorted array in table form.

Print out the array sorted by KEY value in table form.

Part II (We will cover this sorting in class on Wednesday, and might need Monday for other elements of this code.)

Create a two dimensional array (the second dimension should be associative, with keys Name, Karma, and LastLogin, the first can be indexed (1-4). Or you can have both dimensions be associative) that contains the following information about users of your website:

UserID	Name	Karma Score	Last Login
1	Doe	45	2012-08-30
2	Smith	123	2012-09-02
3	Chan	1	2011-12-23
4	Zee	15	2012-07-01

Print out the array sorted by user-id

Print out the array sorted by Login (use the strtotime() function)

Print out only users who have Karma score > 10, sorted by Karma score in descending order.

Add a form to your php file that has a user put in a name and id, with the method post. If the name exists, add 5 to the karma score. If the name does not, add an element to the array with karma score of 1, and today's date (use the date function). Print out the new array.

Here is the code so far:

//Part 1

$firstArray = array(3 => 'B', 2 => 'C', 1 => 'A', 7 => 'E', 5 => 'G', 6 => 'F', 4 => 'H', 8 => 'D');

echo "

";

foreach($firstArray as $n => $l){

echo "

";

echo "

";

echo "

";

echo "

";

}

echo "

Number	Letter
" . $n . "	" . $l . "

";

asort($firstArray);

echo "

";

foreach($firstArray as $n => $l){

echo "

";

echo "

";

echo "

";

echo "

";

}

echo "

Number	Letter
" . $n . "	" . $l . "

";

unset($firstArray[3]);

arsort($firstArray);

echo "

";

foreach($firstArray as $n => $l){

echo "

";

echo "

";

echo "

";

echo "

";

}

echo "

Number	Letter
" . $n . "	" . $l . "

";

ksort($firstArray);

echo "

";

foreach($firstArray as $n => $l){

echo "

";

echo "

";

echo "

";

echo "

";

}

echo "

Number	Letter
" . $n . "	" . $l . "

";

//Part 2

$TwoDimArray = array(2 => array("Smith", 123, "2012-09-02"),4 => array("Zee", 15, "2012-07-01"), 3 => array("Chan", 1, "2011-12-23"), 1 => array("Doe", 45, "2012-08-30"));

ksort($TwoDimArray);

echo "

";

foreach($TwoDimArray as $n => $l){

echo "

";

echo "

";

echo "

";

echo "

";

echo "

";

echo "

";

}

echo "

Number	Name	Karma Score	Login
" . $n . "	" . $l[0] . "	" . $l[1] . "	" . $l[2] . "

";

function timeCompare($x, $y) {

if(strtotime($x[2]) == strtotime($y[2]))

return 0;

elseif(strtotime($x[2]) > strtotime($y[2]))

return 1;

else

return -1;

}

uasort($TwoDimArray, 'timeCompare');

echo "

";

foreach($TwoDimArray as $n => $l){

echo "

";

echo "

";

echo "

";

echo "

";

echo "

";

echo "

";

}

echo "

Number	Name	Karma Score	Login
" . $n . "	" . $l[0] . "	" . $l[1] . "	" . $l[2] . "

";

function karmaSort($x, $y) {

if($x[1] == $y[1])

return 0;

elseif($x[1] > $y[1])

return -1;

else

return 1;

}

uasort($TwoDimArray, 'karmaSort');

echo "

";

foreach($TwoDimArray as $n => $l){

if ($l[1] <= 10)

continue;

echo "

";

echo "

";

echo "

";

echo "

";

echo "

";

echo "

";

}

echo "

Number	Name	Karma Score	Login
" . $n . "	" . $l[0] . "	" . $l[1] . "	" . $l[2] . "

";

?>

Username:

ID:

$userExists = FALSE;

echo "

";

foreach($TwoDimArray as $n => $l){

if(($n == $_POST['id1']) && ($l[0] == $_POST['user1'])){

$l[1] = $l[1] + 5;

$userExists = TRUE;

}

echo "

";

echo "

";

echo "

";

echo "

";

echo "

";

echo "

";

}

echo "

Number	Name	Karma Score	Login
" . $n . "	" . $l[0] . "	" . $l[1] . "	" . $l[2] . "

";

?>